#include <angel_tools.hpp>
Public Member Functions | |
edge_less_t (const Ad_graph_t &_g1, const Ad_graph_t &_g2) | |
Both graphs are given in the constructor. | |
bool | operator() (typename Ad_graph_t::edge_descriptor e1, typename Ad_graph_t::edge_descriptor e2) |
Returns whether e1 is lexicographically less than e2 w.r.t. source and target. | |
Public Attributes | |
const Ad_graph_t & | g1 |
const Ad_graph_t & | g2 |
Definition at line 370 of file angel_tools.hpp.
angel::edge_less_t< Ad_graph_t >::edge_less_t | ( | const Ad_graph_t & | _g1, | |
const Ad_graph_t & | _g2 | |||
) | [inline] |
bool angel::edge_less_t< Ad_graph_t >::operator() | ( | typename Ad_graph_t::edge_descriptor | e1, | |
typename Ad_graph_t::edge_descriptor | e2 | |||
) | [inline] |
Returns whether e1
is lexicographically less than e2
w.r.t. source and target.
Definition at line 378 of file angel_tools.hpp.
References angel::edge_less_t< Ad_graph_t >::g1, and angel::edge_less_t< Ad_graph_t >::g2.
const Ad_graph_t& angel::edge_less_t< Ad_graph_t >::g1 |
Definition at line 372 of file angel_tools.hpp.
Referenced by angel::edge_less_t< Ad_graph_t >::operator()().
const Ad_graph_t& angel::edge_less_t< Ad_graph_t >::g2 |
Definition at line 373 of file angel_tools.hpp.
Referenced by angel::edge_less_t< Ad_graph_t >::operator()().