pele::Node Class Reference

#include <graph.hpp>

List of all members.

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 Member Functions
	Node (node_id id)
void	add_out_edge (edge_ptr edge)
void	remove_out_edge (edge_ptr edge)
edge_list &	get_out_edges ()
edge_iterator	out_edge_begin ()
edge_iterator	out_edge_end ()
void	add_in_edge (edge_ptr edge)
void	remove_in_edge (edge_ptr edge)
edge_list &	get_in_edges ()
edge_iterator	in_edge_begin ()
edge_iterator	in_edge_end ()
node_id	id () const
size_t	out_degree () const
size_t	in_degree () const
size_t	in_out_degree () const
std::set< node_ptr >	in_out_neighbors ()
edge_ptr	get_successor_edge (node_ptr v)
Public Attributes
successor_map_t	successor_map_
double	tau

---

Detailed Description

basic class for a node in the graph

Definition at line 65 of file graph.hpp.

---

Member Typedef Documentation

typedef edge_list::iterator pele::Node::edge_iterator

Definition at line 68 of file graph.hpp.

typedef std::set<edge_ptr> pele::Node::edge_list

Definition at line 67 of file graph.hpp.

typedef std::map<node_ptr, edge_ptr> pele::Node::successor_map_t

Definition at line 69 of file graph.hpp.

---

Constructor & Destructor Documentation

pele::Node::Node

(

node_id

id

)

[inline]

Definition at line 80 of file graph.hpp.

---

Member Function Documentation

void pele::Node::add_in_edge

(

edge_ptr

edge

)

[inline]

Definition at line 96 of file graph.hpp.

void pele::Node::add_out_edge

(

edge_ptr

edge

)

[inline]

Definition at line 84 of file graph.hpp.

edge_list& pele::Node::get_in_edges

(

)

[inline]

Definition at line 98 of file graph.hpp.

edge_list& pele::Node::get_out_edges

(

)

[inline]

Definition at line 92 of file graph.hpp.

edge_ptr pele::Node::get_successor_edge

(

node_ptr

v

)

[inline]

Definition at line 111 of file graph.hpp.

node_id pele::Node::id

(

)

const [inline]

Definition at line 102 of file graph.hpp.

size_t pele::Node::in_degree

(

)

const [inline]

Definition at line 104 of file graph.hpp.

edge_iterator pele::Node::in_edge_begin

(

)

[inline]

Definition at line 99 of file graph.hpp.

edge_iterator pele::Node::in_edge_end

(

)

[inline]

Definition at line 100 of file graph.hpp.

size_t pele::Node::in_out_degree

(

)

const [inline]

Definition at line 105 of file graph.hpp.

std::set< node_ptr > pele::Node::in_out_neighbors

(

)

Definition at line 121 of file graph.hpp.

size_t pele::Node::out_degree

(

)

const [inline]

Definition at line 103 of file graph.hpp.

edge_iterator pele::Node::out_edge_begin

(

)

[inline]

Definition at line 93 of file graph.hpp.

edge_iterator pele::Node::out_edge_end

(

)

[inline]

Definition at line 94 of file graph.hpp.

void pele::Node::remove_in_edge

(

edge_ptr

edge

)

[inline]

Definition at line 97 of file graph.hpp.

void pele::Node::remove_out_edge

(

edge_ptr

edge

)

[inline]

Definition at line 88 of file graph.hpp.

---

Member Data Documentation

successor_map_t pele::Node::successor_map_

Definition at line 77 of file graph.hpp.

double pele::Node::tau

Definition at line 78 of file graph.hpp.

---

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

• /home/sm958/Work/pele/source/pele/graph.hpp