ibmppl::inDisk_Vertex< Data, EdgeList, Directedness, Base > Class Template Reference

Vertex for a large graph where only part of the graph fits into the memory. More...

#include <graph_disk_storage.h>

Inherits ibmppl::inDisk_VertexBase< Data, EdgeList, Directedness, Base >.

Inherited by ibmppl::inDiskRDFVertex< Data, EdgeList, Base >.

Public Types
typedef inDisk_Vertex< Data, EdgeList, Directedness, Base >	this_type
typedef inDisk_VertexBase < Data, EdgeList, Directedness, Base >	base_type
typedef base_type::vertexd_type	vertexd_type
typedef base_type::property_type	property_type
typedef base_type::edgelist_type	edgelist_type
typedef base_type::edge_type	edge_type
typedef base_type::edged_type	edged_type
typedef edge_type::property_type	edge_property_type
typedef edgelist_type::iterator	basic_edge_iterator

Public Member Functions
	inDisk_Vertex (vertexd_type id=-1)
	inDisk_Vertex (vertexd_type id, const property_type &p)

Detailed Description

template<class Data, class EdgeList, DIRECTNESS Directedness, class Base = Vertex<Data, EdgeList,Directedness>>
class ibmppl::inDisk_Vertex< Data, EdgeList, Directedness, Base >

Vertex for a large graph where only part of the graph fits into the memory.

---

The documentation for this class was generated from the following file:

• /home/yxia/Work/ibmppl.gsa/datastructure/graph/dbstore/graph_disk_storage.h