Directed graph
A directed graph is a graph whose edges have an orientation from a source vertex to a destination vertex.
Graph Algorithms for Data Science
A directed network is a network whose relationships have source and target directions that can carry semantic meaning.
- How it is used
- Uses relationship direction to model follower networks and analyze information distribution and influence.
- How deep it goes
- Explains direction through traversal rules, Cypher modeling, and follower-network analysis without formal graph notation.
- Examples
- Uses Twitter-style followers, Kim and Vanessa, and a Cypher FOLLOWS relationship with date properties.
- What you can do after
- Apply it via Cypher and graph algorithms to model one-way ties and characterize follower-network structure.
Read how Graph Algorithms for Data Science explains directed graph →
Learn Haskell by Example
A directed graph is a graph whose edges have orientations that constrain traversal to one direction.
- How it is used
- Uses directed graphs to model word ladders and support shortest-path searches.
- How deep it goes
- Defines orientation and develops polymorphic adjacency-list and map representations with insertion and lookup operations.
- Examples
- Demonstrates word ladders and GHCi queries over integer nodes and directed edges.
- What you can do after
- Builds and queries a polymorphic directed graph using Haskell map operations.
Grokking Data Structures
A directed graph is a graph whose edges have orientations that distinguish a source vertex from a destination vertex.
- How it is used
- Models asymmetric relationships, one-way routes, workflows, processes, and state machines.
- How deep it goes
- Defines edge direction, compares representations, and explains weak and strong connectivity without detailing traversal implementations.
- Examples
- Uses social-network follows, one-way roads, workflows, campaign relationships, and connected-component clusters.
- What you can do after
- Apply directed graphs to relationships where traversal from source to destination is not automatically reversible.
Related concepts
- graphkind of · A graph is a mathematical structure consisting of vertices connected by edges that represent relationships or connections.
- undirected graphcontrasts with · An undirected graph is a graph whose edges have no orientation, so each edge connects its endpoints symmetrically.
- directed acyclic graphincludes · A directed acyclic graph is a graph with directed edges and no directed cycles.
- edgehas part · An edge is a graph connection between two vertices that represents a relationship and may be directed, labeled, or weighted.
- causal graphical modelincludes · A causal graphical model is a probabilistic or structural model whose graph represents causal relationships and whose mechanisms support reasoning about interventions.
- LangGraphused by · LangGraph is a framework for building stateful, graph-structured workflows and applications, including those involving language models and agents.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.