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 10Vertex (graph theory)Compared with: A vertex's incoming and outgoing connections differ when edges have direction.Degree (graph theory)Compared with: Direction separates degree into incoming and outgoing counts.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.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.Hasse diagramCompared with: Unlike a general directed graph, a Hasse diagram suppresses transitive edges and encodes a partial order.Undirected graphCompared with: Unlike undirected edges, its connections distinguish source from destination.Degree matrixCompared with: It distinguishes in-degree and out-degree, yielding different degree matrices.