Software Engineering KB

Home

❯

01 Foundations

❯

01 Algorithms

❯

01 Concept

❯

Traversal

Traversal

Feb 10, 20261 min read

  • algorithms
  • graph-algorithms
  • traversal

Traversal

← Back to Graph Algorithms

Systematic methods for visiting all vertices and edges in a graph. Graph traversal is the foundation for many other graph algorithms.

Key Properties

  • BFS
  • DFS
  • Topological Sort

Related

  • Shortest Path (often built on traversal)
  • Cycle Detection (uses traversal techniques)

algorithms graph-algorithms traversal


Graph View

  • Traversal
  • Key Properties
  • Related

Backlinks

  • Graph Algorithms
  • Cycle Detection
  • Shortest Path
  • Strongly Connected Components
  • BFS
  • DFS
  • Topological Sort

Created with Quartz v4.5.2 © 2026

  • GitHub