A directed graph is a set of vertices connected by directed edges. A sink is a vertex with no outgoing edges, while a source is a vertex with no incoming edges.
To Center | Sink |
To Periphery | Source |
Links
To Center | Sink |
To Periphery | Source |
WARNING: This entry is marked as non-release and pending review.
This is the discussion topic for5018 - Graph (Directed)
.
Feel free to contribute or asking relevant questions.