|
IBM SYSTEMG G RUNTIME & NATIVE STORE
0.5
IBM Native Graph Computing and Storage System based on IBM Parallel Programming Library
|
Specialization for Edge for undirected graphs Undirected graph stores two edges between a pair of vertices, where both edges share the same property. More...
#include <ibm_graph.h>
Public Types | |
| typedef base_type::edged_type | edged_type |
| typedef base_type::vertexd_type | vertexd_type |
| typedef Property | property_type |
Public Types inherited from ibmppl::EdgeBase | |
| enum | FLAGS_T { kDefault = 0, kPropertyValid = 0x00000001 } |
| typedef size_t | edged_type |
| typedef size_t | vertexd_type |
Public Member Functions | |
| Edge (vertexd_type s, vertexd_type t, edged_type id=-1) | |
| Edge (vertexd_type s, vertexd_type t, const property_type &p, edged_type id) | |
| void | link (Edge< Property, UNDIRECTED > &other) |
| void | free_property () |
| void | alloc_property () |
| property_type & | property () |
| const property_type & | property () const |
| void | set_property (property_type &p) |
| bool | is_property_valid () const |
Public Member Functions inherited from ibmppl::EdgeBase | |
| EdgeBase (vertexd_type s, vertexd_type t, edged_type id=0, uint32_t flags=kDefault) | |
| bool | operator== (const EdgeBase &other) const |
| bool | operator!= (const EdgeBase &other) const |
| edged_type | id () const |
| vertexd_type | source () const |
| vertexd_type | target () const |
| void | clear_flag (uint32_t flags) |
| void | set_flag_invalid () |
| void | set_flag (uint32_t flags) |
| bool | test_flag (uint32_t flags) const |
Protected Attributes | |
| smart_pointer< property_type > | _property |
Protected Attributes inherited from ibmppl::EdgeBase | |
| edged_type | _id |
| vertexd_type | _source |
| vertexd_type | _target |
| uint32_t | _flags |
Private Types | |
| typedef EdgeBase | base_type |
|
typedef Edge< Property, UNDIRECTED > | this_type |
Friends | |
| template<class P , DIRECTNESS D> | |
| std::ostream & | operator<< (std::ostream &os, const Edge< P, D > &e) |
Specialization for Edge for undirected graphs Undirected graph stores two edges between a pair of vertices, where both edges share the same property.
1.8.6