2
$\begingroup$

I am new to lean but am interested in proving correctness of graph algorithms. Is there a repository/website that talks about a proof using lean of Dijkstra's shortest path algorithm, for example?

$\endgroup$
2
  • 1
    $\begingroup$ Perhaps Kementzey's Bachelor of Science thesis is a good place to start, regarding graph representation and search. See also this closely related Question. $\endgroup$
    – hardmath
    Commented Sep 16, 2023 at 4:54
  • 1
    $\begingroup$ Sec. 4.2 of the above thesis describes shortest path finding by Dijkstra's algorithm. $\endgroup$
    – hardmath
    Commented Sep 16, 2023 at 16:00

0

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Browse other questions tagged or ask your own question.