MCPcopy Create free account
hub / github.com/BirolLab/abyss / topologicalSort

Function topologicalSort

Graph/PopBubbles.h:32–43  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

30/** Record a topological order of the vertices. */
31template <typename Graph, typename It>
32void topologicalSort(const Graph& g, It it)
33{
34 using boost::default_color_type;
35 using boost::property_map;
36 using boost::vector_property_map;
37 typedef typename property_map<Graph, vertex_index_t>::type
38 VertexIndexMap;
39 typedef vector_property_map<default_color_type, VertexIndexMap>
40 ColorMap;
41 depthFirstSearch(g, TopoVisitor<It>(it),
42 ColorMap(num_vertices(g)));
43}
44
45/** Return true if the specified sequence of vertices is a bubble. */
46template <typename Graph, typename It>

Callers 1

discoverBubblesFunction · 0.85

Calls 2

depthFirstSearchFunction · 0.85
num_verticesFunction · 0.70

Tested by

no test coverage detected