Category: graph

• Graph Traversal

  Say a graph’s vertex set is and edge set is . We want to traverse the graph efficiently, therefore, we want to visit each vertex and each edge exactly once. An edge has two ends: a from and a to. In the edge we can consider as from and as to. The basic traversal strategy…

  tanvirdotzaman

  March 6, 2025

  algorithms, graph