Class Node#

Class Documentation#

class Node#

basic class for a node in the graph

Public Types

typedef std::set<edge_ptr> edge_list#
typedef edge_list::iterator edge_iterator#
typedef std::map<node_ptr, edge_ptr> successor_map_t#

Public Functions

inline Node(node_id id)#
inline void add_out_edge(edge_ptr edge)#
inline void remove_out_edge(edge_ptr edge)#
inline edge_list &get_out_edges()#
inline edge_iterator out_edge_begin()#
inline edge_iterator out_edge_end()#
inline void add_in_edge(edge_ptr edge)#
inline void remove_in_edge(edge_ptr edge)#
inline edge_list &get_in_edges()#
inline edge_iterator in_edge_begin()#
inline edge_iterator in_edge_end()#
inline node_id id() const#
inline size_t out_degree() const#
inline size_t in_degree() const#
inline size_t in_out_degree() const#
inline std::set<node_ptr> in_out_neighbors()#
inline edge_ptr get_successor_edge(node_ptr v)#

Public Members

successor_map_t successor_map_#
double tau#