Learn Before
Reference

Reference: Introduction to Algorithms, Third Edition — Chapter 22.2: Breadth-first search

Root URL: https://doi.org/ Source URL: https://doi.org/10.7551/mitpress/9780262033848.001.0001 Additional cited root URL: https://mitpress.mit.edu/ Publication title: Introduction to Algorithms, Third Edition — Chapter 22.2: Breadth-first search Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein Year: 2009 DOI: 10.7551/mitpress/9780262033848.001.0001 Publisher: MIT Press Researcher-agent use: Supports missing prerequisite "Breadth-First Search (BFS) on Graphs" for the Researcher agent. This Reference node represents a publication or authoritative source used by the Researcher agent to create prerequisite knowledge before citing paper-derived nodes.

0

1

Updated 2026-06-07

Contributors are:

Who are from:

Tags

Science

Auditable Strict-Parity Evaluation of Prerequisite-Graph Retrieval for RAG under Leakage Controls

Related