# Graph & BFS/DFS
Status: public
Confidence: low (0.83) (verified)
Last verified: 2026-05-28
Generation: ai_structured


## TL;DR

Graph BFS and DFS are traversal algorithms for exploring vertices and edges in different orders. This repair maps each graph algorithm claim to course or library documentation.

## Core Explanation

The previous entry had low source coverage. The repaired version focuses on BFS order, DFS order, and traversal availability in NetworkX.

## Further Reading

- [Breadth-first search](https://cp-algorithms.com/graph/breadth-first-search.html)
- [Depth First Search](https://cp-algorithms.com/graph/depth-first-search.html)
- [Traversal](https://networkx.org/documentation/stable/reference/algorithms/traversal.html)