Searched refs:num_paths_through_vertex (Results 1 – 2 of 2) sorted by relevance
58 BOOST_ASSERT(num_paths_through_vertex(g, v[0]) == 3); in test_undirected()59 BOOST_ASSERT(num_paths_through_vertex(g, v[1]) == 1); in test_undirected()60 BOOST_ASSERT(num_paths_through_vertex(g, v[2]) == 1); in test_undirected()61 BOOST_ASSERT(num_paths_through_vertex(g, v[3]) == 0); in test_undirected()62 BOOST_ASSERT(num_paths_through_vertex(g, v[4]) == 1); in test_undirected()
62 num_paths_through_vertex(const Graph& g, Vertex v) in num_paths_through_vertex() function108 T routes = T(num_paths_through_vertex(g, v)); in clustering_coefficient()