 		g3[3, 5] = 1
 		
 		// print(g3)
-		print(g3.hierholzer()!)
+		_ = g3.hierholzer()!
+		
+		print("Hierholzer:\t\t", -start.timeIntervalSinceNow)
 	}
 	
 	func kruskal< G : Graph >(graph: G.Type) {
+		let start = Date()
 		var g0 = G()
 		
 		g0[0, 1] = 1

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

			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\t", time)
	}
	
	func dijkstra(graph: Graph) {
