#include <angel_types.hpp>
Public Types | |
typedef Ad_graph_t::vertex_descriptor | vd_t |
typedef Ad_graph_t::edge_descriptor | ed_t |
typedef boost::graph_traits < Ad_graph_t > ::vertex_iterator | vi_t |
typedef boost::graph_traits < Ad_graph_t > ::edge_iterator | gei_t |
typedef boost::graph_traits < Ad_graph_t > ::in_edge_iterator | ei_t |
typedef boost::graph_traits < Ad_graph_t > ::out_edge_iterator | rei_t |
typedef boost::graph_traits < Ad_graph_t > ::degree_size_type | ds_t |
Public Member Functions | |
predecessor_t (const Ad_graph_t &_adg) | |
ds_t | degree (vd_t v) const |
std::pair< ei_t, ei_t > | edges (vd_t v) const |
vd_t | neighbor (ed_t e) const |
vd_t | neighbor (ei_t ei) const |
ds_t | rdegree (vd_t v) const |
std::pair< rei_t, rei_t > | redges (vd_t v) const |
vd_t | rneighbor (ed_t e) const |
vd_t | rneighbor (rei_t rei) const |
const std::vector < vd_t > & | first () const |
const std::vector < vd_t > & | last () const |
void | clear_vertices (const std::vector< vd_t > &vv) |
Public Attributes | |
const Ad_graph_t & | adg |
Private Attributes | |
std::vector< vd_t > | independents |
Definition at line 464 of file angel_types.hpp.
typedef Ad_graph_t::vertex_descriptor angel::predecessor_t< Ad_graph_t >::vd_t |
Definition at line 466 of file angel_types.hpp.
typedef Ad_graph_t::edge_descriptor angel::predecessor_t< Ad_graph_t >::ed_t |
Definition at line 467 of file angel_types.hpp.
typedef boost::graph_traits<Ad_graph_t>::vertex_iterator angel::predecessor_t< Ad_graph_t >::vi_t |
Definition at line 468 of file angel_types.hpp.
typedef boost::graph_traits<Ad_graph_t>::edge_iterator angel::predecessor_t< Ad_graph_t >::gei_t |
Definition at line 469 of file angel_types.hpp.
typedef boost::graph_traits<Ad_graph_t>::in_edge_iterator angel::predecessor_t< Ad_graph_t >::ei_t |
Definition at line 470 of file angel_types.hpp.
typedef boost::graph_traits<Ad_graph_t>::out_edge_iterator angel::predecessor_t< Ad_graph_t >::rei_t |
Definition at line 471 of file angel_types.hpp.
typedef boost::graph_traits<Ad_graph_t>::degree_size_type angel::predecessor_t< Ad_graph_t >::ds_t |
Definition at line 472 of file angel_types.hpp.
angel::predecessor_t< Ad_graph_t >::predecessor_t | ( | const Ad_graph_t & | _adg | ) | [inline] |
Definition at line 478 of file angel_types.hpp.
References angel::predecessor_t< Ad_graph_t >::adg, and angel::predecessor_t< Ad_graph_t >::independents.
ds_t angel::predecessor_t< Ad_graph_t >::degree | ( | vd_t | v | ) | const [inline] |
std::pair<ei_t, ei_t> angel::predecessor_t< Ad_graph_t >::edges | ( | vd_t | v | ) | const [inline] |
vd_t angel::predecessor_t< Ad_graph_t >::neighbor | ( | ed_t | e | ) | const [inline] |
vd_t angel::predecessor_t< Ad_graph_t >::neighbor | ( | ei_t | ei | ) | const [inline] |
ds_t angel::predecessor_t< Ad_graph_t >::rdegree | ( | vd_t | v | ) | const [inline] |
std::pair<rei_t, rei_t> angel::predecessor_t< Ad_graph_t >::redges | ( | vd_t | v | ) | const [inline] |
vd_t angel::predecessor_t< Ad_graph_t >::rneighbor | ( | ed_t | e | ) | const [inline] |
vd_t angel::predecessor_t< Ad_graph_t >::rneighbor | ( | rei_t | rei | ) | const [inline] |
const std::vector<vd_t>& angel::predecessor_t< Ad_graph_t >::first | ( | ) | const [inline] |
const std::vector<vd_t>& angel::predecessor_t< Ad_graph_t >::last | ( | ) | const [inline] |
Definition at line 503 of file angel_types.hpp.
References angel::predecessor_t< Ad_graph_t >::independents.
void angel::predecessor_t< Ad_graph_t >::clear_vertices | ( | const std::vector< vd_t > & | vv | ) | [inline] |
std::vector<vd_t> angel::predecessor_t< Ad_graph_t >::independents [private] |
Definition at line 474 of file angel_types.hpp.
Referenced by angel::predecessor_t< Ad_graph_t >::last(), and angel::predecessor_t< Ad_graph_t >::predecessor_t().
const Ad_graph_t& angel::predecessor_t< Ad_graph_t >::adg |
Definition at line 476 of file angel_types.hpp.
Referenced by angel::predecessor_t< Ad_graph_t >::clear_vertices(), angel::predecessor_t< Ad_graph_t >::degree(), angel::predecessor_t< Ad_graph_t >::edges(), angel::predecessor_t< Ad_graph_t >::first(), angel::predecessor_t< Ad_graph_t >::neighbor(), angel::predecessor_t< Ad_graph_t >::predecessor_t(), angel::predecessor_t< Ad_graph_t >::rdegree(), angel::predecessor_t< Ad_graph_t >::redges(), and angel::predecessor_t< Ad_graph_t >::rneighbor().