| IBM SYSTEMG G RUNTIME & NATIVE STORE
    0.5
    IBM Native Graph Computing and Storage System based on IBM Parallel Programming Library | 
#include <ibm_graph_rdf.h>
Inherits base_type< VProperty, EProperty, ST >.
| Public Types | |
| typedef base_type::edged_type | edged_type | 
| Edge descriptor or unique edge identifier. | |
| typedef base_type::vertexd_type | vertexd_type | 
| Vertex descriptor. Unique vertex identifier. | |
| typedef base_type::vertex_property | vertex_property | 
| Property type associated with each vertex. | |
| typedef base_type::edge_property | edge_property | 
| Property type associated with each edge. | |
| typedef base_type::vertex_iterator | vertex_iterator | 
| Iterator type for traversing vertices. | |
| typedef base_type::const_vertex_iterator | const_vertex_iterator | 
| typedef base_type::edge_iterator | edge_iterator | 
| edge iterator | |
| Public Member Functions | |
| rdfGraph (const graph_config &gc=graph_config()) | |
| vertex_iterator | vertices_begin () | 
| vertex_iterator | vertices_end () | 
| const_vertex_iterator | vertices_begin () const | 
| const_vertex_iterator | vertices_end () const | 
| vertex_iterator | vertices_begin (size_t lid) | 
| vertex_iterator | vertices_end (size_t lid) | 
| edged_type | add_edge (vertexd_type s, vertexd_type t, const edge_property &ep) | 
| edge_iterator | add_edge_ref (vertexd_type s, vertexd_type t, const edge_property &ep) | 
| Private Types | |
| typedef rdf_infer_base < VProperty, EProperty, ST > ::base_type | base_type | 
RDF graph; It hardwires the vertex and edge property to a multiproperty class; Additionally by default we use an in meory representation; Depending on the storage chosen the graph will derive from an in memory only base class or from disk base class
| typedef base_type::const_vertex_iterator ibmppl::rdfGraph< VProperty, EProperty, ST >::const_vertex_iterator | 
Const Iterator type for traversing edges. You won't be able to modify properties when using this iterator.
 1.8.6
 1.8.6