estar::Upwind Class Reference

#include <Upwind.hpp>

List of all members.

---

Detailed Description

Upwind graph for tracing propagation order.

Public Types
typedef std::set< vertex_t >	set_t
typedef std::map< vertex_t, set_t >	map_t
Public Member Functions
bool	HaveEdge (vertex_t from, vertex_t to) const
void	AddEdge (vertex_t from, vertex_t to)
void	RemoveEdge (vertex_t from, vertex_t to)
	Note: Beware when feeding vertices from iterators to this function, as it modifies the underlying tree structures this can wreak havoc.
void	RemoveIncoming (vertex_t to)
	see also RemoveEdge()
const map_t &	GetMap () const
const set_t &	GetDownwind (vertex_t from) const
Private Attributes
map_t	m_from_to
map_t	m_to_from

---

Member Typedef Documentation

typedef std::set<vertex_t> estar::Upwind::set_t

typedef std::map<vertex_t, set_t > estar::Upwind::map_t

---

Member Function Documentation

bool estar::Upwind::HaveEdge	(	vertex_t	from,
		vertex_t	to
	)			const

void estar::Upwind::AddEdge	(	vertex_t	from,
		vertex_t	to
	)

void estar::Upwind::RemoveEdge	(	vertex_t	from,
		vertex_t	to
	)

Note:

Beware when feeding vertices from iterators to this function, as it modifies the underlying tree structures this can wreak havoc.

Use a temporary structure to collect the vertices to be removed, then loop over the temporary data.

void estar::Upwind::RemoveIncoming

(

vertex_t

to

)

see also RemoveEdge()

const map_t& estar::Upwind::GetMap

(

)

const [inline]

const Upwind::set_t & estar::Upwind::GetDownwind

(

vertex_t

from

)

const

---

Member Data Documentation

map_t estar::Upwind::m_from_to [mutable, private]

map_t estar::Upwind::m_to_from [mutable, private]

---

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

• estar/Upwind.hpp
• estar/Upwind.cpp

---

E* Interpolated Graph Replanner Wed Dec 12 18:55:50 2007