 				XCTAssert(v.value.weight == v.key)
 			}
 		}
-		print("BellmanFord:", time)
+		print("BellmanFord:\t", time)
 	}
 }
 

			fn = graph.breadthFirstSearch(start: 0) { $0 }
		}
		XCTAssert(fn == [0, 1, 2, 3, 4, 7, 5, 6, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20], "\(fn)")
		print("BFS:\t\t", time)
	}
	
	func dijkstra(graph: Graph) {

		kruskal(graph: G.self)
		hierholzer(graph: G.self)
		
		// print(graph)
		
		XCTAssert(graph[1,4] == nil)
		XCTAssert(graph[1,2] == 1)
		XCTAssert(graph[3,7] == 1)
		XCTAssert(graph[2,5] == nil)
		
		// print(MemoryLayout.stride(ofValue: graph))
		print()
		
	}
