|
|||||||||
| Home >> All >> com >> port80 >> graph >> dot >> [ impl overview ] | PREV NEXT | ||||||||
Uses of Package
com.port80.graph.dot.impl
| Classes in com.port80.graph.dot.impl used by com.port80.graph.dot.impl | |
| Anneal
Anneal a placement of a VirtualGraph with dynamic created grid points and meeting spacing requirements. |
|
| Anneal.Stat
|
|
| AnnealWithCell.Stat
|
|
| 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. |
|
| 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. |
|
| DotGraph.AcyclicData
|
|
| DotLine
Wrapper of a dynamic allocated array of DotPoint. |
|
| DotPath
Data structure for routing information. |
|
| 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. |
|
| DotVertex
Graph vertex with spanning tree for ranking. |
|
| 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. |
|
| GridHeap
A heap of Grid customized for AStar algorithm. |
|
| 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. |
|
| Route.TextLine
|
|
| RouteFactory
Route (DotRoute) attribute factory. |
|
| RouteSpline
Spline generation and fitting. |
|
| RouteSpline.BezierPt
|
|
| ShortestPath.Dequeue
|
|
| ShortestPath.PointLink
|
|
| ShortestPath.Triangle
|
|
| ShortestPath.TriEdge
|
|
| Untangle.Cell
Min. |
|
| Untangle.CellHeap
Heap/priority queue of Cell. |
|
| Untangle.CellList
A simple ArrayList never deallocate on clear and have direct access to array. |
|
| Untangle.Stat
|
|
| VirtualChain
A chain of VirtualEdge that should be routed together. |
|
| VirtualEdge
VirtualGraph edge. |
|
| VirtualGraph
Virtual graph constructed for routing from a IGraph. |
|
| VirtualGraph.AdjacencyMatrix
|
|
| VirtualGraph.Rank
|
|
| VirtualPort
Port for VirtualVertex. |
|
| VirtualVertex
Graph vertex with layout information. |
|
|
|||||||||
| Home >> All >> com >> port80 >> graph >> dot >> [ impl overview ] | PREV NEXT | ||||||||