---
id: kb-2026-00131
title: Graph & BFS/DFS
schema_type: TechArticle
category: computer-science
language: en
confidence: low
last_verified: "2026-05-28"
created_date: "2026-05-22"
generation_method: ai_structured
ai_models:
  - claude-opus
derived_from_human_seed: true
conflict_of_interest: none_declared
is_live_document: false
data_period: static
atomic_facts:
  - id: fact-graph-bfs-dfs-1
    statement: Breadth-first search explores graph vertices by increasing distance from a source vertex.
    source_title: Breadth-first search
    source_url: https://cp-algorithms.com/graph/breadth-first-search.html
    confidence: low
  - id: fact-graph-bfs-dfs-2
    statement: Depth-first search explores a graph by following a branch before backtracking.
    source_title: Depth First Search
    source_url: https://cp-algorithms.com/graph/depth-first-search.html
    confidence: low
  - id: fact-graph-bfs-dfs-3
    statement: NetworkX provides traversal routines for breadth-first and depth-first graph search.
    source_title: Traversal
    source_url: https://networkx.org/documentation/stable/reference/algorithms/traversal.html
    confidence: low
completeness: 0.88
known_gaps:
  - This compact repair keeps only source-mapped public claims from the sampled audit entry.
disputed_statements: []
primary_sources:
  - title: Breadth-first search
    type: course_material
    year: 2025
    url: https://cp-algorithms.com/graph/breadth-first-search.html
    institution: CP-Algorithms
  - title: Depth First Search
    type: course_material
    year: 2025
    url: https://cp-algorithms.com/graph/depth-first-search.html
    institution: CP-Algorithms
  - title: Traversal
    type: course_material
    year: 2025
    url: https://networkx.org/documentation/stable/reference/algorithms/traversal.html
    institution: NetworkX
secondary_sources: []
updated: "2026-05-28"
---

## 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)