angel::edge_less_t< Ad_graph_t > Struct Template Reference

Compares edges of different graphs (lexicographically) More...

#include <angel_tools.hpp>

List of all members.

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

---

Detailed Description

template<typename Ad_graph_t>
struct angel::edge_less_t< Ad_graph_t >

Compares edges of different graphs (lexicographically)

Definition at line 378 of file angel_tools.hpp.

---

Constructor & Destructor Documentation

template<typename Ad_graph_t>

angel::edge_less_t< Ad_graph_t >::edge_less_t	(	const Ad_graph_t &	_g1,
		const Ad_graph_t &	_g2
	)		[inline]

Both graphs are given in the constructor.

Definition at line 383 of file angel_tools.hpp.

---

Member Function Documentation

template<typename Ad_graph_t>

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 386 of file angel_tools.hpp.

References angel::edge_less_t< Ad_graph_t >::g1, and angel::edge_less_t< Ad_graph_t >::g2.

---

Member Data Documentation

template<typename Ad_graph_t>

const Ad_graph_t& angel::edge_less_t< Ad_graph_t >::g1

Definition at line 380 of file angel_tools.hpp.

Referenced by angel::edge_less_t< Ad_graph_t >::operator()().

template<typename Ad_graph_t>

const Ad_graph_t& angel::edge_less_t< Ad_graph_t >::g2

Definition at line 381 of file angel_tools.hpp.

Referenced by angel::edge_less_t< Ad_graph_t >::operator()().

---

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

• include/angel_tools.hpp