• Dijkstra Shortest Path

• Referenced in 9 articles [sw28550]
• Dijkstra’s Shortest Path Algorithm. We implement and prove correct Dijkstra’s algorithm ... path problem, conceived in 1956 by E. Dijkstra. The algorithm is implemented using the data...

• Juno-2

• Referenced in 11 articles [sw07216]
• calculus of guarded commands of Edsger W. Dijkstra. Dropping this law introduces “partial commands” (sometimes...

• VeriCon

• Referenced in 5 articles [sw16297]
• invariants, and then implements classical Floyd-Hoare-Dijkstra deductive verification using Z3. Our preliminary experience...

• TiML

• Referenced in 4 articles [sw27564]
• structures like classic list operations, merge sort, Dijkstra’s shortest-path algorithm, red-black trees...

• MOLE

• Referenced in 3 articles [sw18622]
• core of our MOLE algorithm is a Dijkstra’s path search algorithm, which is applied...

• Stern-Brocot Tree

• Referenced in 3 articles [sw28560]
• Stern’s diatonic sequence (also known as Dijkstra’s fusc function) and that...

• Imperative Refinement

• Referenced in 3 articles [sw29235]
• partly commented) practical examples, some highlights being Dijkstra’s Algorithm, Nested-DFS, and a generic...

• DynAlloy

• Referenced in 3 articles [sw39829]
• whose semantics relies on an adaptation of Dijkstra’s weakest liberal precondition. These assertions, defined...

• libeikonal

• Referenced in 2 articles [sw31746]
• present a family of fast and accurate Dijkstra-like solvers for the eikonal equation...

• Auto2_Imperative_HOL

• Referenced in 2 articles [sw32246]
• interval trees, priority queue, quicksort, union-find, Dijkstra’s algorithm, and a sweep-line algorithm...

• RevTree

• Referenced in 1 article [sw37680]
• algorithm is based on a well-known Dijkstra’s algorithm, which is used to solve ... shortest path problem [9]. Dijkstra’s algorithm uses a definition of neighborhood of graph vertex...

• EfficientJetMarcher

• Referenced in 1 article [sw42395]
• which can be solved for numerically via Dijkstra-like label-setting methods. Previous Dijkstra-like...

• Quickgraph

• Referenced in 1 article [sw09943]
• such as the depth-first-search, the Dijkstra shortest path, etc. As the library comes...

• exp4j

• Referenced in 1 article [sw24969]
• library without any external dependencies, that implements Dijkstra’s Shunting Yard Algorithm. exp4j comes with...

• JVer

• Referenced in 1 article [sw25426]
• conditions in the style of Hoare and Dijkstra. JVer is similar to ESC/Java, except that...

• AdTree

• Referenced in 1 article [sw39843]
• establishing a minimum spanning tree using the Dijkstra shortest-path algorithm. Then, the initial tree...

• HTSSIP

• Referenced in 0 articles [sw17532]
• Egbert Schwartz, J. Gregory Caporaso, Paul Dijkstra, Natasja van Gestel, Benjamin J. Koch...

• CGAL

• Referenced in 402 articles [sw00118]
• The goal of the CGAL Open Source Project...

• Cocktail

• Referenced in 5 articles [sw00142]
• Cocktail: A tool for deriving correct programs (Eindhoven...

• gmp

• Referenced in 289 articles [sw00363]
• GMP is a free library for arbitrary precision...