Home
last modified time | relevance | path

Searched refs:numVertex (Results 1 – 1 of 1) sorted by relevance

/third_party/boost/libs/graph/test/
Dbellman-test.cpp34 int const numVertex = static_cast< int >(Z) + 1; in main() local
44 Graph g(edge_array, edge_array + numEdges, numVertex); in main()
54 std::vector< int > parent(numVertex); in main()
55 for (i = 0; i < numVertex; ++i) in main()
59 std::vector< int > distance(numVertex, inf); in main()
62 bool const r = bellman_ford_shortest_paths(g, int(numVertex), weight_pmap, in main()
71 for (int i = 0; i < numVertex; ++i) in main()
89 std::vector< int > parent2(numVertex); in main()
90 std::vector< int > distance2(numVertex, 17); in main()
100 for (int i = 0; i < numVertex; ++i) in main()