Linked from

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

• Graph (discrete mathematics)Broader topic: Orientation distinguishes one-way relationships from ordinary undirected edges.

• Incidence matrixRelated: Directed edges motivate distinguishing their starting and ending vertices in matrix entries.

• Shortest path problemRelated: Direction changes which routes exist and is central to many applications.

• Edge (graph theory)Broader topic: An edge's orientation determines which endpoint is its source and which is its target.

• Vertex (graph theory)Compared with: A vertex's incoming and outgoing connections differ when edges have direction.

• Binary relationRelated: A relation on a set can be drawn as directed edges between its elements.

• Breadth-first searchRelated: In directed graphs, the traversal follows outgoing edges from each reached vertex.

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

• Degree (graph theory)Compared with: Direction separates degree into incoming and outgoing counts.

• Transitive relationRelated: A relation can be drawn as directed edges, making two-step paths and required shortcut edges visible.

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

• Cayley graphCompared with: Directed Cayley graphs can represent semigroup actions or one-way generator steps.

• HypergraphCompared with: Orienting pairwise edges does not by itself represent higher-order connections.

• Simple graphCompared with: Its ordered connections differ from the undirected edges of a simple graph.

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

• Weighted graphCompared with: Weights and direction are separate properties, though both can shape a graph model.

• Adjacency listCompared with: Its lists record outgoing neighbors, so each directed edge has a source-specific entry.

• 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.

• Antisymmetric relationRelated: A relation can be drawn as directed edges; antisymmetry rules out two-way edges between distinct vertices.

• 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.

• Hasse diagramCompared with: Unlike a general directed graph, a Hasse diagram suppresses transitive edges and encodes a partial order.

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

• Undirected graphCompared with: Unlike undirected edges, its connections distinguish source from destination.

• 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.

• Degree matrixCompared with: It distinguishes in-degree and out-degree, yielding different degree matrices.

• Floyd–Warshall algorithmRelated: The algorithm handles directed edges and can represent an undirected edge with two arcs.

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

• Collatz conjectureRelated: Collatz trajectories can be represented as directed paths between integers.

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

• Perron–Frobenius theoremRelated: A nonnegative matrix is irreducible precisely when its associated graph is strongly connected.

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

• Directed networkBroader topic: Its oriented edges give the network its defining structure.

• 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.