Computer Science/Algorithms/Graph

Relational Minimum Spanning Tree Algorithms
by Walter Guttmann and Nicolas Robinson-O’Brien

Purely Functional, Simple, and Efficient Implementation of Prim and Dijkstra
by Peter Lammich and Tobias Nipkow

Kruskal's Algorithm for Minimum Spanning Forest
by Maximilian P. L. Haslbeck, Peter Lammich and Julian Biendarra

Formalizing Push-Relabel Algorithms
by Peter Lammich and S. Reza Sefidgar

The Floyd-Warshall Algorithm for Shortest Paths
by Simon Wimmer and Peter Lammich

Formalizing the Edmonds-Karp Algorithm
by Peter Lammich and S. Reza Sefidgar

A Framework for Verifying Depth-First Search Algorithms
by Peter Lammich and René Neumann

Verified Efficient Implementation of Gabow's Strongly Connected Components Algorithm
by Peter Lammich

Transitive closure according to Roy-Floyd-Warshall
by Makarius Wenzel

Executable Transitive Closures
by René Thiemann

Dijkstra's Shortest Path Algorithm
by Benedikt Nordhoff and Peter Lammich

Executable Transitive Closures of Finite Relations
by Christian Sternagel and René Thiemann

Verification of the Deutsch-Schorr-Waite Graph Marking Algorithm using Data Refinement
by Viorel Preoteasa and Ralph-Johan Back

Depth First Search
by Toshiaki Nishihara and Yasuhiko Minamide