hyperlode
hyperlode
/ dijkstra_example.py
Created
October 8, 2018 18:39
— forked from avrilcoghlan/dijkstra_example.py
Python script to implement Dijkstra's algorithm for an undirected graph
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # https://gist.github.com/avrilcoghlan/7466166 | |
| # https://avrilomics.blogspot.com/2013/11/dijkstras.html | |
| genes = ['g1', 'g2', 'g3', 'g4', 'g5', 'g6', 'g7'] | |
| G1 = 0 | |
| G2 = 1 | |
| G3 = 2 | |
| G4 = 3 | |
| G5 = 4 | |
| G6 = 5 |