Home >> All >> com >> port80 >> graph >> dot >> [ impl Javadoc ]

• com.port80.graph.dot.impl: Javadoc index of package com.port80.graph.dot.impl.


Package Samples:

• com.port80.graph.dot.impl

Classes:

• Anneal: Anneal a placement of a VirtualGraph with dynamic created grid points and meeting spacing requirements. For bus->bus and vertex->bus routes, grid start from the vertex x-coordinates and edge-edge (ESPACING) spacing apart on both sides. For vertex->vertex routes, grid start from the src x-coordinates and with (dest.x-src.x)/ESPACING divisions such that grid points are aligned with both src.x and dest.x. Each grid point is checked against existing vertices to make sure there are proper spacings. . Since Grid are now created dynamically, static data (eg. crossCost) are now moved to VirtualVertex and ...
• AnnealWithCell: Anneal a placement of a VirtualGraph. . Output from MinCross and Position often contains some very obvious layout problem mainly due to MinCross having no distance information consider those cases as equivalent. Especially for bus routing, there are lots of opportunities to improve the layout by taking advantage the fact that anywhere on the bus is equivalent. . shortestPath() try to find a point to line or point to point path with minimum distance in the VirtualGraph with placement. Another pass of Position may be required to compact the layout afterwards. For bus-bus connections, shortestPath() ...
• DotGraph: DotGraph is an intermediate graph created for layout using the 'dot' layout algorithms. DotGraph is created from an IGraph with additional V/E added or removed to be used by the NetworkSimplex.dotRank(). . DotGraph is created by extracting the topology information from an input IGraph. Instead of overlay onto the original graph, DotDirectGraph build an independent copy of the original graph. . Layout result are patched back to the original graph attribute table ('pos','-rank') and the DotGraph can be released after each layout. . DotGraph is read only since neither the vertex nor the edges from ...
• Untangle: Untangle a placement of a VirtualGraph. Global cross reduction using shortest path algoirthm on output of MinCross. . This is adapted from Anneal except that without actual coordinates, the distance and turn cost are not used. Instead of find the actual shortest path, the goal is just to go around crossings. Instead of using a grid, the map opens a channel between each pair of vertices for routing. NOTE: . After an edge chain is erased before routing, the vertex cells still keep the .vertex and .crossCost fields valid and used for cross cost calculations.
• Position: position(g): set n.coord (x and y) for all nodes n of g, using g.rank. (the graph may be modified by merging certain edges with a common endpoint.) the coordinates are computed by constructing and ranking an auxiliary graph. then leaf nodes are inserted in the fast graph. cluster boundary nodes are created and correctly separated.
• VirtualGraph: Virtual graph constructed for routing from a IGraph. . VirtualGraph is created by extracting the topology information from an input IGraph for routing. . Routing information are patched back to the original graph attribute table ('pos') and the VirtualGraph can be released after each layout.
• GridFactory: Grid factory for vertices in a given VirtualGraph. This class provide methods to create and manipulate Grid objects for the given VirtualGraph. To avoid allocation of lots of Grid object that are used only for a short time. The Grid factory maintains a pool of allocated Grid objects.
• DotPolyline: Wrapper of a dynamic allocated array of pre-allocated DotPoint. The point array are pre-allocated with DotPoint so they can be reused without having to be re-allocated each time. . The class keep its own copy of the points so prevent cross linking with other objects.
• VirtualChain: A chain of VirtualEdge that should be routed together. Typically represents an IEdge or a portion an an IEdge (eg. a stub or a bus). The tail of a chain is the top-most VirtualVertex. The head of a chain is the bottom-most VirtualVertex.
• MinCross: Find an ordering with minimum edge crossing for a ranked graph with clusters are expanded. . The rank structure is global (not allocated per cluster) because mincross may compare nodes in different clusters.
• VirtualEdge: VirtualGraph edge. VirtualEdge should be create through the factory method in the VirtualGraph class. FIXME: . Instead of (head,tail), should use (tail,head) in parameters which is more natural to use.
• BoxToBound: Construct bounding polygon from path boxes. . Since the code make assumption on the constant values, the constants and routine are packed into this class to decouple them from others.
• NetworkSimplex: Network Simplex Algorithm for ranking an acyclic directed graph. . Clusters and same/min/max ranked subgraphs should have been collapsed into a single vertex for ranking.
• DotBoxList: An allocated list of DotBox. To avoid allocating lots of small DotBox objects, the list have pre-allocated list of DotBox and would never replace them with other boxes.
• DotSpline: Spline class represent a spline of n-Bezier segments with 3n+1 points. //TODO: Should use int[] x,y instead IntPoint.
• DotPath: Data structure for routing information. . Boxes in the path are not pre-allocated and are added by reference.
• CellList: A simple ArrayList never deallocate on clear and have direct access to array.
• GridHeap: A heap of Grid customized for AStar algorithm. The heap used Grid.heapIndex.

Home | Contact Us | Privacy Policy | Terms of Service