| begin() const | galois::graphs::FileGraph | |
| containsNode(const GraphNode n) const | galois::graphs::FileGraph | inline |
| divideByEdge(size_t nodeSize, size_t edgeSize, size_t id, size_t total) | galois::graphs::FileGraph | |
| divideByNode(size_t nodeSize, size_t edgeSize, size_t id, size_t total) | galois::graphs::FileGraph | |
| edge_begin(GraphNode N) | galois::graphs::FileGraph | |
| edge_data_begin() const | galois::graphs::FileGraph | inline |
| edge_data_end() const | galois::graphs::FileGraph | inline |
| edge_end(GraphNode N) | galois::graphs::FileGraph | |
| edge_id_begin() const | galois::graphs::FileGraph | |
| edge_id_end() const | galois::graphs::FileGraph | |
| edge_id_iterator typedef | galois::graphs::FileGraph | |
| edge_iterator typedef | galois::graphs::FileGraph | |
| EdgeRange typedef | galois::graphs::FileGraph | |
| edges(GraphNode N) | galois::graphs::FileGraph | inline |
| edgeSize() const | galois::graphs::FileGraph | inline |
| end() const | galois::graphs::FileGraph | |
| FileGraph() | galois::graphs::FileGraph | |
| FileGraph(const FileGraph &) | galois::graphs::FileGraph | |
| FileGraph(FileGraph &&) | galois::graphs::FileGraph | |
| fromArrays(uint64_t *outIdx, uint64_t numNodes, void *outs, uint64_t numEdges, char *edgeData, size_t sizeofEdgeData, uint64_t nodeOffset, uint64_t edgeOffset, bool converted, int oGraphVersion=1) | galois::graphs::FileGraph | protected |
| fromFile(const std::string &filename) | galois::graphs::FileGraph | |
| fromFileInterleaved(const std::string &filename, typename std::enable_if<!std::is_void< EdgeTy >::value >::type *=0) | galois::graphs::FileGraph | inline |
| fromFileInterleaved(const std::string &filename, typename std::enable_if< std::is_void< EdgeTy >::value >::type *=0) | galois::graphs::FileGraph | inline |
| fromGraph(FileGraph &g) | galois::graphs::FileGraph | inline |
| getEdgeData(GraphNode src, GraphNode dst) | galois::graphs::FileGraph | inline |
| getEdgeData(edge_iterator it) | galois::graphs::FileGraph | inline |
| getEdgeDst(edge_iterator it) | galois::graphs::FileGraph | |
| GraphNode typedef | galois::graphs::FileGraph | |
| GraphRange typedef | galois::graphs::FileGraph | |
| hasNeighbor(GraphNode N1, GraphNode N2) | galois::graphs::FileGraph | |
| iterator typedef | galois::graphs::FileGraph | |
| neighbor_begin(GraphNode N) | galois::graphs::FileGraph | inline |
| neighbor_end(GraphNode N) | galois::graphs::FileGraph | inline |
| neighbor_iterator typedef | galois::graphs::FileGraph | |
| node_id_begin() const | galois::graphs::FileGraph | |
| node_id_end() const | galois::graphs::FileGraph | |
| node_id_iterator typedef | galois::graphs::FileGraph | |
| NodeRange typedef | galois::graphs::FileGraph | |
| num_bytes_read() | galois::graphs::FileGraph | inline |
| operator=(const FileGraph &) | galois::graphs::FileGraph | |
| operator=(FileGraph &&) | galois::graphs::FileGraph | |
| out_edges(GraphNode N) | galois::graphs::FileGraph | inline |
| partFromFile(const std::string &filename, NodeRange nrange, EdgeRange erange, bool numaMap=false) | galois::graphs::FileGraph | |
| reset_byte_counters() | galois::graphs::FileGraph | inline |
| size() const | galois::graphs::FileGraph | inline |
| sizeEdges() const | galois::graphs::FileGraph | inline |
| sortEdges(GraphNode N, const CompTy &comp) | galois::graphs::FileGraph | inline |
| sortEdgesByEdgeData(GraphNode N, const CompTy &comp=std::less< EdgeTy >()) | galois::graphs::FileGraph | inline |
| toFile(const std::string &file) | galois::graphs::FileGraph | |
| ~FileGraph() | galois::graphs::FileGraph | |