Add 'universe/' from commit '8ad51b24dd'
				
					
				
			git-subtree-dir: universe git-subtree-mainline:15110e6de9git-subtree-split:8ad51b24dd
This commit is contained in:
		
						commit
						fb9380ba26
					
				
					 131 changed files with 13792 additions and 0 deletions
				
			
		
							
								
								
									
										26
									
								
								universe/deepmind/dijkstra.py
									
										
									
									
									
										Normal file
									
								
							
							
						
						
									
										26
									
								
								universe/deepmind/dijkstra.py
									
										
									
									
									
										Normal file
									
								
							|  | @ -0,0 +1,26 @@ | |||
| # Doing a practice implementation of Dijkstra's algorithm: a priority-first | ||||
| # search. | ||||
| from heapq import heappush, heappop | ||||
| 
 | ||||
| 
 | ||||
| class Node(object): | ||||
|     def __init__(self, value, children): | ||||
|         self.value = value | ||||
|         self.children = children | ||||
| 
 | ||||
| 
 | ||||
| def shortest_path(a, b): | ||||
|     """Return the shortest path from `a` to `b`.""" | ||||
|     q = [] | ||||
|     seen = set() | ||||
|     heappush((a.value, a, [a]), q) | ||||
| 
 | ||||
|     while q: | ||||
|         d, node, path = heappop(q) | ||||
|         if node == b: | ||||
|             return path | ||||
|         seen.add(node) | ||||
|         for child in node.children: | ||||
|             if child not in seen: | ||||
|                 heappush((d + child.value, child, path + [child]), q) | ||||
|     raise Exception("Path between nodes A and B does not exist.") | ||||
		Loading…
	
	Add table
		Add a link
		
	
		Reference in a new issue