#include "Galois/Graph/OCGraph.h"
#include "Galois/Graph/GraphNodeBag.h"
#include <boost/iterator/filter_iterator.hpp>
#include <boost/utility.hpp>
Go to the source code of this file.
Classes | |
struct | Galois::GraphChi::hidden::DispatchOperator< PassWrappedGraph > |
struct | Galois::GraphChi::hidden::DispatchOperator< false > |
class | Galois::GraphChi::hidden::SparseVertexMap< PassWrappedGraph, Graph, WrappedGraph, VertexOperator > |
class | Galois::GraphChi::hidden::DenseVertexMap< CheckInput, PassWrappedGraph, Graph, WrappedGraph, VertexOperator, Bag > |
struct | Galois::GraphChi::hidden::contains_node< Graph, Bag > |
struct | Galois::GraphChi::hidden::sizeof_edge< EdgeTy > |
struct | Galois::GraphChi::hidden::sizeof_edge< void > |
struct | Galois::GraphChi::hidden::logical_or |
Namespaces | |
namespace | Galois |
Main Galois namespace. | |
namespace | Galois::GraphChi |
Implementation of GraphChi DSL in Galois. | |
namespace | Galois::GraphChi::hidden |
Functions | |
template<typename Graph , typename Seg , typename Bag > | |
bool | Galois::GraphChi::hidden::any_in_range (Graph &graph, const Seg &cur, Bag *input) |
template<typename Graph > | |
size_t | Galois::GraphChi::hidden::computeEdgeLimit (Graph &graph, size_t memoryLimit) |
template<typename Graph > | |
bool | Galois::GraphChi::hidden::fitsInMemory (Graph &graph, size_t memoryLimit) |
template<bool CheckInput, bool PassWrappedGraph, typename Graph , typename WrappedGraph , typename VertexOperator , typename Bag > | |
void | Galois::GraphChi::hidden::vertexMap (Graph &graph, WrappedGraph &wgraph, VertexOperator op, Bag *input, size_t memoryLimit) |
template<typename Graph , typename VertexOperator > | |
void | Galois::GraphChi::vertexMap (Graph &graph, VertexOperator op, size_t size) |
template<typename Graph , typename VertexOperator , typename Bag > | |
void | Galois::GraphChi::vertexMap (Graph &graph, VertexOperator op, Bag &input, size_t size) |