Structure maintaining the data for a single neighbor. More...
#include <vvgraph.h>
Inherits graph::__vvgraph_EdgeCache< VVGRAPH_COMPACT_EDGE, EdgeContent, VVGraph, single_neighborhood_t, std::list< neighbor_t > >.
Public Types | |
typedef __vvgraph_EdgeCache < VVGRAPH_COMPACT_EDGE, EdgeContent, VVGraph, single_neighborhood_t, std::list< neighbor_t > > | base |
typedef std::list< neighbor_t > | edge_list_t |
Type of the list of outgoing neighbors. | |
Public Member Functions | |
void | clear_edge () |
neighbor_t (const neighbor_t ©) | |
neighbor_t (const vertex_t &tgt, const EdgeContent &e, single_neighborhood_t &n, intptr_t gid) | |
Constructor. | |
neighbor_t & | operator= (const neighbor_t ©) |
bool | operator== (const neighbor_t &other) const |
Equality of two neighbors/edge. | |
Public Attributes | |
vertex_t | target |
Target of the edge. |
Structure maintaining the data for a single neighbor.
Definition at line 431 of file vvgraph.h.
typedef std::list<neighbor_t> graph::VVGraph< VertexContent, EdgeContent, compact >::neighbor_t::edge_list_t |
graph::VVGraph< VertexContent, EdgeContent, compact >::neighbor_t::neighbor_t | ( | const vertex_t & | tgt, | |
const EdgeContent & | e, | |||
single_neighborhood_t & | n, | |||
intptr_t | gid | |||
) | [inline] |
bool graph::VVGraph< VertexContent, EdgeContent, compact >::neighbor_t::operator== | ( | const neighbor_t & | other | ) | const [inline] |
Equality of two neighbors/edge.
A single neighbor is equal to another if the vertex and the content are the same
Definition at line 485 of file vvgraph.h.
References graph::VVGraph< VertexContent, EdgeContent, compact >::neighbor_t::target.
00486 { 00487 return (target == other.target) && 00488 (static_cast<const EdgeContent&>(*this) == static_cast<const EdgeContent&>(other)); 00489 }
vertex_t graph::VVGraph< VertexContent, EdgeContent, compact >::neighbor_t::target |
Target of the edge.
i.e. neighbor itself
Definition at line 477 of file vvgraph.h.
Referenced by graph::VVGraph< VertexContent, EdgeContent, compact >::neighbor_t::operator==(), and graph::VVGraph< VertexContent, EdgeContent, compact >::updateEdgeCache().