 		let start = Date()
 		let visited = g.bellmanFord(start: 0)
 		let time = -start.timeIntervalSinceNow
-		print(visited.map { "\($0.key) - \($0.value.last): \($0.value.weight)" })
+		// print(visited.map { "\($0.key) - \($0.value.last): \($0.value.weight)" })
 		for v in visited {
 			if v.key >= 5 {
 				XCTAssert(v.value.weight == Int.min)

			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) {

			graph[7,3] = 1
		}
		
		print("Creation:\t\t", time)
		
		let graph2 = G.init(vertices: Set<Int>(0...20), rule: { return abs($0 - $1) == 1 ? 1 : (($0, $1) == (3,7) || ($0, $1) == (7,3) ? 1 : nil) })
		
