Contain the definition of the VVGraph template class. More...
#include <config.h>
#include <graph/vertex.h>
#include <graph/edge.h>
#include <util/tie.h>
#include <util/member_iterator.h>
#include <util/circ_iterator.h>
#include <util/set_vector.h>
#include <util/range.h>
#include <storage/fwd.h>
#include <utility>
#include <memory>
#include <algorithm>
#include <iterator>
#include <list>
#include <vector>
#include <set>
#include <map>
#include <iostream>
Go to the source code of this file.
Classes | |
class | graph::_EmptyEdgeContent |
Empty class used as default for edge content. More... | |
struct | graph::VVGraph< VertexContent, EdgeContent, compact >::neighbor_t |
Structure maintaining the data for a single neighbor. More... | |
struct | graph::VVGraph< VertexContent, EdgeContent, compact >::search_result_t< Neighborhood, Iterator > |
Type of the result of the search for a vertex in a neighborhood. More... | |
struct | graph::VVGraph< VertexContent, EdgeContent, compact >::single_neighborhood_t |
Type of the neighborhood of a vertex. More... | |
class | graph::VVGraph< VertexContent, EdgeContent, compact > |
Class representing a VV graph. More... | |
Namespaces | |
namespace | graph |
Contains all the classes related to the graphs. | |
namespace | std |
STL namespace. | |
Defines | |
#define | GRAPH_ARGS VertexContent,EdgeContent,compact |
#define | GRAPH_TEMPLATE typename VertexContent, typename EdgeContent, bool compact |
#define | VVGRAPH_COMPACT_EDGE compact |
#define | VVGRAPH_COMPACT_VERTEX compact |
Functions | |
template<typename Graph > | |
void | graph::create_graph_methods (Graph &G) |
intptr_t | graph::getNextGraphId () |
template<GRAPH_TEMPLATE > | |
void | std::swap (graph::VVGraph< GRAPH_ARGS > &g1, graph::VVGraph< GRAPH_ARGS > &g2) |
Specialize the swap algorithm for two graphs. |
Contain the definition of the VVGraph template class.
Definition in file vvgraph.h.