Skip to content

First working version of directed graph BFS#1

Open
nnhjy wants to merge 13 commits intomainfrom
bfs-alg-diGraph
Open

First working version of directed graph BFS#1
nnhjy wants to merge 13 commits intomainfrom
bfs-alg-diGraph

Conversation

@nnhjy
Copy link
Copy Markdown
Collaborator

@nnhjy nnhjy commented May 2, 2026

In brief:

  • computable BFS algorithm
  • analytical definition of shortest path
  • correctness proof of the BFS alg. aligning with the shortest path def.
  • more helper lemmas added to Core\Walk.lean and DirectedGraphs\Walk.lean

Next steps (after this PR):

  • clean up tedious intermediate steps, e.g. lemma bfs_complete_aux and lemma IsPathIn.suffix. Feel free to flag up if you spot any.
  • extend the current BFS alg. to one that generates a tree

@nnhjy nnhjy self-assigned this May 2, 2026
@nnhjy nnhjy requested a review from sorrachai May 2, 2026 16:37
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant