typedef adjacency_list<setS, vecS, undirectedS,
        property<vertex_color_t, default_color_type,
            property<vertex_degree_t, int,
                property< vertex_priority_t, double > > > > Graph;

typedef graph_traits<Graph>::vertex_descriptor Vertex;
typedef graph_traits<Graph>::vertices_size_type size_type;

Graph g = Graph(2);
property_map<Graph, vertex_index_t>::type index_map = get(vertex_index, g);

std::vector<Vertex> inv_perm(num_vertices(g));
std::vector<size_type> perm(num_vertices(g));

sloan_ordering(g, inv_perm.begin(), get(vertex_color, g), make_degree_map(g), get(vertex_priority, g));

for (typename std::vector<Vertex>::const_iterator i=inv_perm.begin(); i != inv_perm.end(); ++i) {
    printf("i: %d\n", *i);
}