| allNodesRange() const | galois::graphs::DistGraph< NodeTy, EdgeTy > | inline |
| allNodesWithEdgesRange() const | galois::graphs::DistGraph< NodeTy, EdgeTy > | inline |
| base_DistGraph typedef | galois::graphs::MiningGraph< NodeTy, EdgeTy, Partitioner > | |
| beginMaster | galois::graphs::DistGraph< NodeTy, EdgeTy > | protected |
| cartesianGrid() const | galois::graphs::DistGraph< NodeTy, EdgeTy > | inlinevirtual |
| computeMasters(MASTERS_DISTRIBUTION masters_distribution, galois::graphs::OfflineGraph &g, const std::vector< unsigned > &scalefactor, uint32_t nodeWeight=0, uint32_t edgeWeight=0, unsigned DecomposeFactor=1) | galois::graphs::DistGraph< NodeTy, EdgeTy > | inlineprotected |
| const_iterator typedef | galois::graphs::DistGraph< NodeTy, EdgeTy > | |
| constructLocalEdgeGIDMap() | galois::graphs::MiningGraph< NodeTy, EdgeTy, Partitioner > | inline |
| deallocate() | galois::graphs::DistGraph< NodeTy, EdgeTy > | inline |
| determineThreadRanges() | galois::graphs::DistGraph< NodeTy, EdgeTy > | inlineprotected |
| determineThreadRangesMaster() | galois::graphs::DistGraph< NodeTy, EdgeTy > | inlineprotected |
| determineThreadRangesWithEdges() | galois::graphs::DistGraph< NodeTy, EdgeTy > | inlineprotected |
| DistGraph(unsigned host, unsigned numHosts) | galois::graphs::DistGraph< NodeTy, EdgeTy > | inline |
| edge_begin(GraphNode N) | galois::graphs::DistGraph< NodeTy, EdgeTy > | inline |
| edge_end(GraphNode N) | galois::graphs::DistGraph< NodeTy, EdgeTy > | inline |
| edge_iterator typedef | galois::graphs::DistGraph< NodeTy, EdgeTy > | |
| edges(GraphNode N) | galois::graphs::DistGraph< NodeTy, EdgeTy > | inline |
| edgesEqualMasters() | galois::graphs::DistGraph< NodeTy, EdgeTy > | inlineprotected |
| EdgeType typedef | galois::graphs::DistGraph< NodeTy, EdgeTy > | |
| evilPhasePlus1() | galois::graphs::DistGraph< NodeTy, EdgeTy > | inlineprotected |
| findSourceFromEdge(uint64_t lid) | galois::graphs::MiningGraph< NodeTy, EdgeTy, Partitioner > | inline |
| G2L(uint64_t gid) const | galois::graphs::DistGraph< NodeTy, EdgeTy > | inlineprotected |
| getData(GraphNode N, galois::MethodFlag mflag=galois::MethodFlag::UNPROTECTED) | galois::graphs::DistGraph< NodeTy, EdgeTy > | inline |
| getEdgeData(edge_iterator ni, galois::MethodFlag mflag=galois::MethodFlag::UNPROTECTED) | galois::graphs::DistGraph< NodeTy, EdgeTy > | inline |
| getEdgeDst(edge_iterator ni) | galois::graphs::DistGraph< NodeTy, EdgeTy > | inline |
| getEdgeGID(uint64_t lid) | galois::graphs::MiningGraph< NodeTy, EdgeTy, Partitioner > | inline |
| getEdgeLID(uint64_t gid) | galois::graphs::MiningGraph< NodeTy, EdgeTy, Partitioner > | inline |
| getGID(const uint32_t nodeID) const | galois::graphs::DistGraph< NodeTy, EdgeTy > | inline |
| getHostID(uint64_t gid) const | galois::graphs::MiningGraph< NodeTy, EdgeTy, Partitioner > | inlinevirtual |
| getHostReader(uint64_t gid) const | galois::graphs::MiningGraph< NodeTy, EdgeTy, Partitioner > | inline |
| getLID(const uint64_t nodeID) const | galois::graphs::DistGraph< NodeTy, EdgeTy > | inline |
| getLIDFromMap(unsigned src, unsigned dst) | galois::graphs::MiningGraph< NodeTy, EdgeTy, Partitioner > | inline |
| getMirrorEdges() | galois::graphs::MiningGraph< NodeTy, EdgeTy, Partitioner > | inline |
| getMirrorNodes() | galois::graphs::DistGraph< NodeTy, EdgeTy > | inline |
| getMirrorRanges() const | galois::graphs::DistGraph< NodeTy, EdgeTy > | inline |
| getNumNodesWithEdges() const | galois::graphs::DistGraph< NodeTy, EdgeTy > | inline |
| gid2host | galois::graphs::DistGraph< NodeTy, EdgeTy > | protected |
| globalEdges() const | galois::graphs::MiningGraph< NodeTy, EdgeTy, Partitioner > | inline |
| globalSize() const | galois::graphs::DistGraph< NodeTy, EdgeTy > | inline |
| globalSizeEdges() const | galois::graphs::DistGraph< NodeTy, EdgeTy > | inline |
| globalToLocalMap | galois::graphs::DistGraph< NodeTy, EdgeTy > | protected |
| graph | galois::graphs::DistGraph< NodeTy, EdgeTy > | protected |
| GraphNode typedef | galois::graphs::DistGraph< NodeTy, EdgeTy > | |
| id | galois::graphs::DistGraph< NodeTy, EdgeTy > | protected |
| increment_evilPhase() | galois::graphs::DistGraph< NodeTy, EdgeTy > | inlineprotected |
| initializeSpecificRanges() | galois::graphs::DistGraph< NodeTy, EdgeTy > | inlineprotected |
| isLocal(uint64_t gid) const | galois::graphs::MiningGraph< NodeTy, EdgeTy, Partitioner > | inlinevirtual |
| isOwned(uint64_t gid) const | galois::graphs::MiningGraph< NodeTy, EdgeTy, Partitioner > | inlinevirtual |
| isTransposed() | galois::graphs::DistGraph< NodeTy, EdgeTy > | inline |
| iterator typedef | galois::graphs::DistGraph< NodeTy, EdgeTy > | |
| L2G(uint32_t lid) const | galois::graphs::DistGraph< NodeTy, EdgeTy > | inlineprotected |
| lgMapAccesses | galois::graphs::MiningGraph< NodeTy, EdgeTy, Partitioner > | |
| localToGlobalVector | galois::graphs::DistGraph< NodeTy, EdgeTy > | protected |
| masterNodesRange() const | galois::graphs::DistGraph< NodeTy, EdgeTy > | inline |
| MiningGraph(const std::string &filename, unsigned host, unsigned _numHosts, bool setupGluon=true, bool doSort=false, galois::graphs::MASTERS_DISTRIBUTION md=BALANCED_EDGES_OF_MASTERS, uint32_t nodeWeight=0, uint32_t edgeWeight=0) | galois::graphs::MiningGraph< NodeTy, EdgeTy, Partitioner > | inline |
| mirrorNodes | galois::graphs::DistGraph< NodeTy, EdgeTy > | protected |
| numEdges | galois::graphs::DistGraph< NodeTy, EdgeTy > | protected |
| numGlobalEdges | galois::graphs::DistGraph< NodeTy, EdgeTy > | protected |
| numGlobalNodes | galois::graphs::DistGraph< NodeTy, EdgeTy > | protected |
| numHosts | galois::graphs::DistGraph< NodeTy, EdgeTy > | protected |
| numMasters() const | galois::graphs::DistGraph< NodeTy, EdgeTy > | inline |
| numNodes | galois::graphs::DistGraph< NodeTy, EdgeTy > | protected |
| numNodesWithEdges | galois::graphs::DistGraph< NodeTy, EdgeTy > | protected |
| numOwned | galois::graphs::DistGraph< NodeTy, EdgeTy > | protected |
| numOwnedEdges() const | galois::graphs::MiningGraph< NodeTy, EdgeTy, Partitioner > | inline |
| read_local_graph_from_file(std::string) | galois::graphs::DistGraph< NodeTy, EdgeTy > | inline |
| readersFromFile(galois::graphs::OfflineGraph &g, std::string filename) | galois::graphs::DistGraph< NodeTy, EdgeTy > | inlineprotected |
| reportAccess() | galois::graphs::MiningGraph< NodeTy, EdgeTy, Partitioner > | inline |
| reportAccessBefore() | galois::graphs::MiningGraph< NodeTy, EdgeTy, Partitioner > | inline |
| save_local_graph_to_file(std::string) | galois::graphs::DistGraph< NodeTy, EdgeTy > | inline |
| size() const | galois::graphs::DistGraph< NodeTy, EdgeTy > | inline |
| sizeEdges() const | galois::graphs::DistGraph< NodeTy, EdgeTy > | inline |
| sortEdgesByDestination() | galois::graphs::DistGraph< NodeTy, EdgeTy > | inline |
| transposed | galois::graphs::DistGraph< NodeTy, EdgeTy > | protected |
| ~MiningGraph() | galois::graphs::MiningGraph< NodeTy, EdgeTy, Partitioner > | inline |
1.8.5 
