| 1 | typedef adjacency_list<setS, vecS, undirectedS,
|
|---|
| 2 | property<vertex_color_t, default_color_type,
|
|---|
| 3 | property<vertex_degree_t, int,
|
|---|
| 4 | property< vertex_priority_t, double > > > > Graph;
|
|---|
| 5 |
|
|---|
| 6 | typedef graph_traits<Graph>::vertex_descriptor Vertex;
|
|---|
| 7 | typedef graph_traits<Graph>::vertices_size_type size_type;
|
|---|
| 8 |
|
|---|
| 9 | Graph g = Graph(2);
|
|---|
| 10 | property_map<Graph, vertex_index_t>::type index_map = get(vertex_index, g);
|
|---|
| 11 |
|
|---|
| 12 | std::vector<Vertex> inv_perm(num_vertices(g));
|
|---|
| 13 | std::vector<size_type> perm(num_vertices(g));
|
|---|
| 14 |
|
|---|
| 15 | sloan_ordering(g, inv_perm.begin(), get(vertex_color, g), make_degree_map(g), get(vertex_priority, g));
|
|---|
| 16 |
|
|---|
| 17 | for (typename std::vector<Vertex>::const_iterator i=inv_perm.begin(); i != inv_perm.end(); ++i) {
|
|---|
| 18 | printf("i: %d\n", *i);
|
|---|
| 19 | }
|
|---|
| 20 |
|
|---|
