KnowraDirected graphLinked fromLinked fromThe 39 pages that link to Directed graph, each with the reason it gives.All 39Broader topic 3Related 9Narrower topic 17Compared with 10Incidence 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.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.Transitive relationRelated: A relation can be drawn as directed edges, making two-step paths and required shortcut edges visible.Antisymmetric relationRelated: A relation can be drawn as directed edges; antisymmetry rules out two-way edges between distinct vertices.Floyd–Warshall algorithmRelated: The algorithm handles directed edges and can represent an undirected edge with two arcs.Collatz conjectureRelated: Collatz trajectories can be represented as directed paths between integers.Perron–Frobenius theoremRelated: A nonnegative matrix is irreducible precisely when its associated graph is strongly connected.