Namespaces |
namespace | detail |
| Implementation details for graphs.
|
namespace | FirstGraphImpl |
Classes |
class | FileGraphAllocator |
struct | read_default_graph_tag |
struct | read_with_aux_graph_tag |
struct | read_lc_inout_graph_tag |
struct | EdgeSortValue |
| Proxy object for detail::EdgeSortIterator. More...
|
class | FileGraph |
| Graph serialized to a file. More...
|
class | FileGraphWriter |
| Simplifies writing graphs. More...
|
class | FirstGraph |
| A Graph. More...
|
class | LC_CSR_Graph |
| Local computation graph (i.e., graph structure does not change). More...
|
class | LC_InlineEdge_Graph |
| Local computation graph (i.e., graph structure does not change). More...
|
class | LC_InOut_Graph |
| Modify a LC_Graph to have in and out edges. More...
|
class | LC_Linear_Graph |
| Local computation graph (i.e., graph structure does not change). More...
|
class | LC_Morph_Graph |
| Local computation graph (i.e., graph structure does not change). More...
|
class | MemScalGraph |
class | BindSegmentGraph |
| Binds the segment parameter of an out-of-core graph so that it can be used in place of a non out-of-core graph. More...
|
class | OCFileGraph |
| Like FileGraph but allows partial loading of the graph. More...
|
struct | read_oc_immutable_edge_graph_tag |
class | OCImmutableEdgeGraph |
class | SpatialTree2d |
| Stores sets of objects at specific spatial coordinates in a quad tree. More...
|
struct | is_segmented |
struct | ReadGraphConstructFrom |
struct | ReadGraphConstructNodesFrom |
struct | ReadGraphConstructEdgesFrom |
Functions |
template<typename EdgeTy > |
void | makeSymmetric (FileGraph &in, FileGraph &out) |
| Adds reverse edges to a graph.
|
template<typename EdgeTy , typename PTy > |
void | permute (FileGraph &in, const PTy &p, FileGraph &out) |
| Permutes a graph.
|
template<typename GraphTy , typename... Args> |
GALOIS_ATTRIBUTE_DEPRECATED void | structureFromFile (GraphTy &g, const std::string &fname, Args &&...args) |
template<typename GraphTy , typename... Args> |
void | readGraphDispatch (GraphTy &graph, read_oc_immutable_edge_graph_tag, Args &&...args) |
template<typename GraphTy , typename... Args> |
void | readGraph (GraphTy &graph, Args &&...args) |
| Allocates and constructs a graph from a file.
|
template<typename GraphTy > |
void | readGraphDispatch (GraphTy &graph, read_default_graph_tag tag, const std::string &filename) |
template<typename GraphTy > |
void | readGraphDispatch (GraphTy &graph, read_default_graph_tag, FileGraph &f) |
template<typename GraphTy > |
void | readGraphDispatch (GraphTy &graph, read_with_aux_graph_tag tag, const std::string &filename) |
template<typename GraphTy > |
void | readGraphDispatch (GraphTy &graph, read_with_aux_graph_tag, FileGraph &f) |
template<typename GraphTy > |
void | readGraphDispatch (GraphTy &graph, read_lc_inout_graph_tag, const std::string &f1, const std::string &f2) |
template<typename GraphTy > |
void | readGraphDispatch (GraphTy &graph, read_lc_inout_graph_tag, const std::string &f1) |
Parallel graph data structures.
template<typename EdgeTy , typename PTy >
void Galois::Graph::permute |
( |
FileGraph & |
in, |
|
|
const PTy & |
p, |
|
|
FileGraph & |
out | |
|
) |
| | [inline] |
Permutes a graph.
Permutation array, P, conforms to: P[i] = j where i is a node index from the original graph and j is a node index in the permuted graph. New, permuted graph is placed in the out parameter. The previous graph in out is destroyed.
- Parameters:
-
| in | original graph |
| p | permutation array |
| out | permuted graph |