Home >> All >> org >> jxcl >> [ graph Javadoc ]

• org.jxcl.graph: Javadoc index of package org.jxcl.graph.


Package Samples:

• org.jxcl.graph

Classes:

• Directed: A graph consisting of vertices connected by directed, weighted edges. The graph is guaranteed to have at least an entry and an exit point and to always be well-formed, in the sense that there will be a path from the entry vertex to any other vertex in the graph, and there will be a path from any vertex in the graph to the exit vertex These graphs may be nested. In such a case both graphs will be well-formed the entry and exit points of the subgraph are in the graph all paths from the entry point of the parent to a point in the subgraph will pass through the entry point of the subgraph all paths ...
• Visitor: Methods for visiting a JXCL directed graph. Implementations can assume that a walk across the graph using Walker will touch every vertex and edge in the target graph and in every subgraph once and only once. Entry and exit points are in their graphs.
• BinaryConnector: A Connector holding two edges. Implementation detail: we assume that in laying out bytecode the 'else' code appears immediately after the if but the 'then' code is accessed using a goto.
• Connector: Connector holding one or more edges. Used to connect a vertex to the rest of a graph. There is always a preferred edge which is visited first when walking the graph.
• Walker: Walks a Visitor through a JXCL directed graph, visiting each vertex and edge once and only once. Any subgraphs are visited with the same guarantee.
• ComplexConnector: A Connector holding a single edge plus a fixed size array of edges. This is a combination of the UnaryConnector and MultiConnector.
• MultiConnector: A Connector holding a array of edges, where the array has at least one member. The first element of the array is preferred.
• Edge: An edge in a JXCL graph. This is seen as a source/target pair, XXX but in fact the source field may be unnecessary.
• Exit: An exit vertex in a directed graph. This vertex always has an index of 1.
• Entry: The entry vertex in a directed graph.
• UnaryConnector: A Connector holding a single edge.
• Vertex: A vertex in a directed graph.
• TestDirected
• TestA2O

Home | Contact Us | Privacy Policy | Terms of Service