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
| <html><head> | |
| <meta http-equiv="X-UA-Compatible" content="IE=EmulateIE11"> | |
| <meta name="viewport" content="width=device-width"> | |
| <meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1"> | |
| <base href="http://www.licitacoes-e.com.br/aop/lct/"> | |
| <title>www.licitacoes-e.com.br</title> | |
| <link href="../imagem/bbfav.ico" rel="SHORTCUT ICON"> | |
dyohan9
/ gist:6f616e3773c1546f665e611e9c646fec
Created
January 26, 2020 15:07
— forked from econchick/gist:4666413
Python implementation of Dijkstra's Algorithm
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
| 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): |