DrupalCamp Vienna 2013 - Connecting Open Minds
Build an algorithm to predict friendships, then actually use it to meet people | Grouper
Mahtab Ghamsari mghamsar
dergachev
/ webdesign-bookmarks.md
Created
April 15, 2015 15:33
econchick
/ gist:4666413
Last active
December 22, 2023 13:32
Python implementation of Dijkstra's Algorithm
This file contains hidden or 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
| 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): |