Linked from

The 39 pages that link to Directed graph, each with the reason it gives.

• PageRankNarrower topic: Web links form the directed edges on which PageRank bases its scores.

• Directed acyclic graphNarrower topic: A directed acyclic graph is a directed graph with the additional restriction that cycles are absent.

• Topological sortingNarrower topic: Topological sorting orders vertices according to these directed edges.

• Flow conservationNarrower topic: Flow conservation is imposed at vertices of a directed network.

• Dependency graphNarrower topic: Dependency edges point from a component to a prerequisite, or in the reverse convention.

• Residual graphNarrower topic: Residual relationships are represented by directed edges.

• Flow networkNarrower topic: Every network edge specifies a permitted direction for flow.

• Ford–Fulkerson algorithmNarrower topic: Flow directions and residual reverse edges are represented with directed edges.

• Transitive closureNarrower topic: Directed edges provide the paths whose endpoint pairs enter the closure.

• Circulation problemNarrower topic: Circulation assigns flow to oriented edges rather than undirected connections.

• Directed cycleNarrower topic: Directed cycles are closed routes formed from its oriented edges.

• Bellman–Ford algorithmNarrower topic: Bellman–Ford relaxes each directed edge according to its orientation.

• Minimum-cost flow problemNarrower topic: Flow paths follow directed arcs from supply nodes toward demand nodes.

• Boolean networkNarrower topic: Its edges encode which variables can influence which others.

• BEST theoremNarrower topic: The theorem applies to directed graphs with balanced indegrees and outdegrees.

• Road coloring theoremNarrower topic: The theorem begins with a directed graph whose edges are to be colored.

• Robbins' theoremNarrower topic: Orienting an undirected graph produces the directed structure tested by the theorem.