Description euclidian dijkstra
The lab3 package provides two functions: euclidian and dijkstra.
The euclidian function find the greatest common divisor of two numbers.
The dijkstra function takes a graph and an initial node and calculates the shortest path from the initial node to every other node in the graph.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.