Undirected graph
An undirected graph is a graph whose edges have no orientation, so each edge connects its endpoints symmetrically.
Graph Algorithms for Data Science
An undirected network is a network whose relationships have no traversal direction and therefore connect node pairs symmetrically.
- How it is used
- Models relationships whose direction adds no semantic value, including friendship and co-occurrence networks.
- How deep it goes
- Explains bidirectional traversal, Cypher notation, directed encodings, storage choices, and an algorithmic denominator adjustment.
- Examples
- Uses mutual friendship, weighted hashtag co-occurrence, and common-neighbor clustering coefficients as concrete examples.
- What you can do after
- Apply via Cypher by modeling, traversing, projecting, and analyzing relationships with undirected semantics.
Read how Graph Algorithms for Data Science explains undirected graph →
Graph Neural Networks in Action
An undirected graph is a graph whose edges have no direction, so a connection from one node to another also connects the reverse pair.
- How it is used
- Uses symmetric, direction-free relationships to represent sensor networks, referrals, and other graph structures for GNN workflows.
- How deep it goes
- Explains matrix symmetry, weights, self-loops, and alternative representations through concrete graph structures.
- Examples
- Uses a five-node adjacency matrix, skeletal sensor connections, and candidate referral networks as concrete examples.
- What you can do after
- Apply direction-free edges when representing relationships and prepare the resulting structure for a GNN pipeline.
Read how Graph Neural Networks in Action explains undirected graph →
Grokking Data Structures
An undirected graph is a graph whose edges represent symmetric relationships without an orientation from one vertex to another.
- How it is used
- Models symmetric relationships such as friendships and professional connections, then supports neighborhood and connectivity analysis.
- How deep it goes
- Defines two-way traversal, connected components, representations, BFS, and DFS, but does not provide implementation code or formal proofs.
- Examples
- Uses Facebook friendship, LinkedIn connections, Tiger and Lion neighborhoods, and disconnected clusters as concrete graph examples.
- What you can do after
- Evaluate relationships, identify connected components, and choose BFS or DFS for graph traversal and path analysis.
Read how Grokking Data Structures explains undirected graph →
Natural Language Processing in Action, Second Edition
An undirected graph is a graph whose relationships do not have a direction.
- How it is used
- Represents reciprocal relationships and groups semantically similar sentences into visual clusters.
- How deep it goes
- Defines nodes, edges, and reciprocity, then demonstrates thresholded weighted construction and force-directed plotting.
- Examples
- Uses Facebook friendships, Twitter following, sentence similarities, NetworkX nodes, weighted edges, and spring-layout plots.
- What you can do after
- Build it from scratch with Python and NetworkX, using similarity scores to create and plot an undirected graph.
Read how Natural Language Processing in Action, Second Edition explains undirected graph →
Learn Haskell by Example
An undirected graph is a graph whose edges have no orientation and can be traversed in either direction.
- How it is used
- Uses graph representation to build word-ladder networks before searching for shortest paths.
- How deep it goes
- Defines nodes, edges, direction, costs, and adjacency lists, then identifies linear-scan performance drawbacks.
- Examples
- Uses a dictionary-based word ladder whose words become nodes and ladder steps become equal-cost edges.
- What you can do after
- Build it from scratch as a polymorphic Haskell adjacency list and assess its scanning costs.
Read how Learn Haskell by Example explains undirected graph →
Related concepts
- graphkind of · A graph is a mathematical structure consisting of vertices connected by edges that represent relationships or connections.
- directed graphcontrasts with · A directed graph is a graph whose edges have an orientation from a source vertex to a destination vertex.
- bidirectional relationshipequivalent to · A bidirectional relationship is an association between entities that supports navigation or traversal in both directions.
- edgecontrasts with · An edge is a graph connection between two vertices that represents a relationship and may be directed, labeled, or weighted.
- GDS librarycontrasts with · The Neo4j Graph Data Science library is a software library providing graph algorithms, projections, and analytical workflows for graph data.
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.