feat: demo DFS with mathlib Graph and TimeM - #804
Draft
Shreyas4991 wants to merge 1 commit into
Draft
Conversation
Shreyas4991
changed the title
Shreyas4991
changed the title
This was referenced Aug 15, 2026
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Disclosure : This PR is not meant to be merged. Please do not review this PR with marging in mind. This PR is meant to demonstrate a point.
This PR is a demo that graph algorithms in the TimeM framework can indeed be built with mathlib's graph API and an adjacency list constructor. This PR is not meant to be merged. I believe the adjacency list constructor API belongs in mathlib. It serves to demonstrate that the claim made in #503 that graph theory needs to be reinvented to implement and verify graph algorithms.
AI Acknowledgement : I gave explicit instructions to codex on how to generate the adjacency list API and how to write the DFS algorithm on this structure and prove its correctness and time complexity. I also explicitly instructed codex to cost (tick) the DFS code in the TimeM writer monad at all data structure operations following the textbook analysis. I explicitly instructed codex to write DFS using two tail recursive loops. I do not vouch for the complete accuracy of this code, but I have skimmed it and all seems fine.