|
|||||||||
| Home >> All >> com >> port80 >> graph >> dot >> [ impl overview ] | PREV PACKAGE NEXT PACKAGE | ||||||||
Package com.port80.graph.dot.impl
| Class Summary | |
| Anneal | Anneal a placement of a VirtualGraph with dynamic created grid points and meeting spacing requirements. |
| Anneal_Test01 | Check Anneal() rank cost calculation methods. |
| Anneal_Test02 | |
| Anneal_TestBenchmark01 | |
| AnnealWithCell | Anneal a placement of a VirtualGraph. |
| BoxToBound | Construct bounding polygon from path boxes. |
| Cell | |
| CellHeap | Using this heap is about 25% faster than using BinarySearch and LinkedList. |
| CellList | A simple ArrayList never deallocate on clear and have direct access to array. |
| CubicSolver | |
| Dot | Graph layout. |
| DotBox | |
| DotBoxList | An allocated list of DotBox. |
| DotEdge | Graph edge interface. |
| DotGraph | DotGraph is an intermediate graph created for layout using the 'dot' layout algorithms. |
| DotLine | Wrapper of a dynamic allocated array of DotPoint. |
| DotPath | Data structure for routing information. |
| DotPathEnd | |
| DotPoint | Wrapper of a dynamic allocated array of DotPoint. |
| DotPolyline | Wrapper of a dynamic allocated array of pre-allocated DotPoint. |
| DotRoute | A wrapper around a GeneralPath with end points. |
| DotSpline | Spline class represent a spline of n-Bezier segments with 3n+1 points. |
| DotUtil | Static utilities for this package. |
| DotVertex | Graph vertex with spanning tree for ranking. |
| DotVertex.NameComparator | Compare DotVertex by its name (same ordering as String). |
| DotVertex.RankComparator | Compare DotVertex by its rank (lowest rank highest priority). |
| ErasedPath | Data structure to hold information about the erased path. |
| Grid | Dynamic grid point for Anneal (equivalent to Cell for AnnealWithCell). |
| GridFactory | Grid factory for vertices in a given VirtualGraph. |
| GridFactory_Test01 | |
| GridFactory.ValidXIterator | ValidXIterator find all the valid x-coordinates that a Grid point can be created for each rank. |
| GridHeap | A heap of Grid customized for AStar algorithm. |
| GridHeap_Test01 | |
| IntPoint | |
| MinCross | Find an ordering with minimum edge crossing for a ranked graph with clusters are expanded. |
| NetworkSimplex | Network Simplex Algorithm for ranking an acyclic directed graph. |
| Position | position(g): set n.coord (x and y) for all nodes n of g, using g.rank. |
| Route | Draw splines for VirtualGraph. |
| Route.TextLabel | |
| Route.TextLine | |
| RouteFactory | Route (DotRoute) attribute factory. |
| RouteSpline | Spline generation and fitting. |
| RouteSpline.BezierPt | |
| ShortestPath | |
| ShortestPath.Dequeue | |
| ShortestPath.PointLink | |
| ShortestPath.Triangle | |
| ShortestPath.TriEdge | |
| TestUtil | Utilities for tests. |
| Untangle | Untangle a placement of a VirtualGraph. |
| VirtualChain | A chain of VirtualEdge that should be routed together. |
| VirtualChain.ChainTypeComparator | Sort edge in drawing order. |
| VirtualChain.PTPSlackComparator | Comparator based on slack (length/direct distance) of the chain (Larger first). |
| VirtualEdge | VirtualGraph edge. |
| VirtualEdge.EdgeChainComparator | Sort edge in drawing order. |
| VirtualGraph | Virtual graph constructed for routing from a IGraph. |
| VirtualGraph_Test01 | |
| VirtualGraph.AdjacencyMatrix | |
| VirtualGraph.Rank | |
| VirtualPort | Port for VirtualVertex. |
| VirtualVertex | Graph vertex with layout information. |
| VirtualVertex.MedianComparator | |
| VirtualVertex.NameComparator | |
| VirtualVertex.OrderComparator | |
|
|||||||||
| Home >> All >> com >> port80 >> graph >> dot >> [ impl overview ] | PREV PACKAGE NEXT PACKAGE | ||||||||