MorphoGraphX
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
Public Types | Public Member Functions | Public Attributes | List of all members
mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc >::neighbor_t Struct Reference

Structure maintaining the data for a single neighbor. More...

#include <VVGraph.hpp>

+ Inheritance diagram for mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc >::neighbor_t:

Public Types

typedef std::list< neighbor_tedge_list_t
 Type of the list of outgoing neighbors.
 

Public Member Functions

 neighbor_t (const vertex_t &tgt, const EdgeContent &e)
 Constructor.
 
 neighbor_t (const neighbor_t &copy)
 
void clear_edge ()
 
neighbor_toperator= (const neighbor_t &copy)
 
bool operator== (const neighbor_t &other) const
 Equality of two neighbors/edge. More...
 

Public Attributes

vertex_t target
 Target of the edge. More...
 

Detailed Description

template<typename VertexContent, typename EdgeContent = _EmptyEdgeContent, typename Alloc = std::allocator<VertexContent>>
struct mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc >::neighbor_t

Structure maintaining the data for a single neighbor.

Member Function Documentation

template<typename VertexContent, typename EdgeContent = _EmptyEdgeContent, typename Alloc = std::allocator<VertexContent>>
bool mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc >::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

Member Data Documentation

template<typename VertexContent, typename EdgeContent = _EmptyEdgeContent, typename Alloc = std::allocator<VertexContent>>
vertex_t mgx::graph::VVGraph< VertexContent, EdgeContent, Alloc >::neighbor_t::target

Target of the edge.

i.e. neighbor itself


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