#include <DistEdgeList.h>
template<typename IT>
class combblas::DistEdgeList< IT >
Definition at line 81 of file DistEdgeList.h.
◆ DistEdgeList() [1/3]
◆ DistEdgeList() [2/3]
◆ DistEdgeList() [3/3]
◆ ~DistEdgeList()
◆ CleanupEmpties()
Removes all edges that begin with a -1. Walks back from the end to tighten the nedges counter, then walks forward and replaces any edge with a -1 source with the last edge.
Definition at line 190 of file DistEdgeList.cpp.
◆ Dump32bit()
◆ Dump64bit()
◆ GenGraph500Data()
template<typename IT >
void combblas::DistEdgeList< IT >::GenGraph500Data |
( |
double |
initiator[4], |
|
|
int |
log_numverts, |
|
|
int |
edgefactor, |
|
|
bool |
scramble = false , |
|
|
bool |
packed = false |
|
) |
| |
Note that GenGraph500Data will return global vertex numbers (from 1... N). The ith edge can be accessed with edges[2*i] and edges[2*i+1]. There will be duplicates and the data won't be sorted. Generates an edge list consisting of an RMAT matrix suitable for the Graph500 benchmark.
Definition at line 223 of file DistEdgeList.cpp.
◆ getEdges()
◆ getGlobalV()
◆ getNumLocalEdges()
◆ getPackedEdges()
◆ PermEdges
template<typename IT>
template<typename IU >
◆ RenameVertices
template<typename IT>
template<typename IU >
Rename vertices globally. You first need to do create a random permutation distributed on all processors. Then the p round robin algorithm will do the renaming: For all processors P(i,i) Broadcast local_p to all p processors For j= i*N/p to min((i+1)*N/p, N) Rename the all j's with local_p(j) inside the edgelist (and mark them "renamed" so that yeach vertex id is renamed only once)
Definition at line 364 of file DistEdgeList.cpp.
◆ SpParMat
template<typename IT>
template<class IU , class NU , class UDER >
◆ commGrid
The documentation for this class was generated from the following files: