Classes | |
| struct | Node |
| struct | Process |
Typedefs | |
| typedef Galois::Graph::FirstGraph < Node, void, false > | Graph |
| typedef Graph::GraphNode | GNode |
| typedef std::pair< GNode, GNode > | Edge |
Functions | |
| void | runSerial (const std::vector< GNode > &initial, Galois::InsertBag< Edge > &result) |
| void | runParallel (const std::vector< GNode > &initial, Galois::InsertBag< Edge > &result) |
| bool | verify (Galois::InsertBag< Edge > &result) |
| void | readGraph (const char *filename, int root_id, GNode *root) |
Variables | |
| const char * | name = "Spanning-tree Algorithm" |
| const char * | description = "Compute the spanning tree (not mimimal) of a graph" |
| const char * | url = NULL |
| const char * | help = "<root id> <graph>" |
| Graph | graph |
| typedef Graph::GraphNode anonymous_namespace{SpanningTree.cpp}::GNode |
| void anonymous_namespace{SpanningTree.cpp}::readGraph | ( | const char * | filename, | |
| int | root_id, | |||
| GNode * | root | |||
| ) |
| void anonymous_namespace{SpanningTree.cpp}::runParallel | ( | const std::vector< GNode > & | initial, | |
| Galois::InsertBag< Edge > & | result | |||
| ) |
| void anonymous_namespace{SpanningTree.cpp}::runSerial | ( | const std::vector< GNode > & | initial, | |
| Galois::InsertBag< Edge > & | result | |||
| ) |
| bool anonymous_namespace{SpanningTree.cpp}::verify | ( | Galois::InsertBag< Edge > & | result | ) |
| const char* anonymous_namespace{SpanningTree.cpp}::description = "Compute the spanning tree (not mimimal) of a graph" |
| const char* anonymous_namespace{SpanningTree.cpp}::name = "Spanning-tree Algorithm" |
| const char* anonymous_namespace{SpanningTree.cpp}::url = NULL |
1.6.3