Skip to content

Instantly share code, notes, and snippets.

@manoelstilpen
manoelstilpen / gist:6f29e6c5d767f715b5ecd51eab1deec1
Last active June 9, 2017 00:44 — forked from econchick/gist:4666413
Python implementation of Dijkstra's Algorithm
class Graph:
def __init__(self):
self.nodes = set()
self.edges = defaultdict(list)
self.distances = {}
def add_node(self, value):
self.nodes.add(value)
def add_edge(self, from_node, to_node, distance):