public interface DirectedGraph extends Graph
In a directed graph, components have an explicit direction associated with them.
Directed nodes differentiate between those adjacent edges that originate at them (outgoing edges
) and those that terminate at them (incoming edges).
Directed edges differentiate between the node at the the source of the edge (source node) and the
node at the destination of the edges (destination node).
The following is a figure of an undirected graph, and one of the possible directed graphs that
can be derived from it. Directionality is indicated by arrow heads on the edges of the graph.
The following information summarizes the relationships in the directed version of the graph.
Edge | Source Node | Destination Node |
---|---|---|
A | 1 | 4 |
B | 2 | 4 |
C | 3 | 4 |
D | 4 | 5 |
E | 4 | 7 |
F | 4 | 6 |
G | 5 | 7 |
H | 6 | 7 |
Node | In Edges | Out Edges |
---|---|---|
1 | A | |
2 | B | |
3 | C | |
4 | A,B,C | D,E,F |
5 | D | G |
6 | F | F |
7 | E,G,H |
DirectedNode
,
DirectedEdge
FAIL_QUERY, PASS_AND_CONTINUE, PASS_AND_STOP
getEdges, getNodes, getNodesOfDegree, getVisitedEdges, getVisitedNodes, queryEdges, queryNodes, visitEdges, visitNodes
Copyright © 1996–2018 Geotools. All rights reserved.