 		let gnN = g.nearestNeighbor(start: 0)!
 		XCTAssert(gnN.0 == [0, 1, 2, 3, 4, 5, 7, 8, 9, 10, 6])
 		XCTAssert(gnN.1 == -11)
+		print("NearestNeighbor:", -start.timeIntervalSinceNow)
 	}
 	
 	func bellmanFord< G : Graph >(graph: G.Type) {

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

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