Graph Traversal

What is the Graph Database Model?

A graph database stores data as nodes (entities) and edges (relationships between them), both of which can carry properties, and it is optimized to traverse re…

What Are the Basics of Graph Queries in Neo4j?

Neo4j stores data as nodes (entities) and relationships (typed, directed connections between them), and Cypher, its query language, lets you match patterns of…

BFS vs DFS: What is the Difference?

BFS (breadth-first search) explores a graph level by level using a queue, while DFS (depth-first search) explores as deep as possible along one path before bac…

What is Kosaraju's Algorithm?

Kosaraju's algorithm finds all strongly connected components (SCCs) of a directed graph in O(V + E) time using two depth-first search passes: one on the origin…

What is Tarjan's Algorithm?

Tarjan's algorithm finds all strongly connected components (SCCs) of a directed graph in a single O(V + E) DFS pass by tracking each vertex's discovery time an…

What is the Hamiltonian Path Problem?

A Hamiltonian path is a path through a graph that visits every vertex exactly once, and finding one (or deciding one exists) is NP-complete in general, solved…

How Do You Find the Shortest Path in an Unweighted Graph?

The shortest path between two vertices in an unweighted graph is found with breadth-first search (BFS), which explores the graph level by level from the source…

What is the Single-Source Shortest Path Problem?

Single-source shortest path (SSSP) finds the minimum-cost route from one fixed source vertex to every other reachable vertex in a graph, solved with BFS for un…