Home
last modified time | relevance | path

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

/third_party/boost/libs/graph/example/
Dminimum_degree_ordering.cpp144 Vector inverse_perm(n, 0); in main() local
155 make_iterator_property_map(&degree[0], id, degree[0]), &inverse_perm[0], in main()
174 if (comp != inverse_perm[i] + 1) in main()
177 << " ***is NOT EQUAL to*** " << inverse_perm[i] + 1 in main()
/third_party/boost/boost/graph/
Dminimum_degree_ordering.hpp327 InversePermutationMap inverse_perm; member in boost::detail::mmd_impl
344 InversePermutationMap inverse_perm, PermutationMap perm, in mmd_impl() argument
350 , inverse_perm(inverse_perm) in mmd_impl()
357 , numbering(inverse_perm, n_, vertex_index_map) in mmd_impl()
747 InversePermutationMap inverse_perm, PermutationMap perm, in minimum_degree_ordering() argument
752 impl(G, num_vertices(G), delta, degree, inverse_perm, perm, in minimum_degree_ordering()
755 impl.build_permutation(inverse_perm, perm); in minimum_degree_ordering()
/third_party/boost/libs/graph/test/
Dmin_degree_empty.cpp24 std::vector< int > inverse_perm(n, 0); in main() local
/third_party/boost/libs/graph/doc/
Dminimum_degree_ordering.w223 InversePermutationMap inverse_perm,