| dijkstra | Algorithm to find the shortest path from inital node to all... | 
| euclidian | algorithm to find the greatest common divisor of two numbers. | 
| euclidian_A | This is a function that uses the euclidean algorithm | 
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.