Base class for edge weighted graphs. More...

#include <bioprocessing/graph/edgeweightedgraph.h>

Inheritance diagram for bio::EWBaseGraph< E, W >:

[legend]

Collaboration diagram for bio::EWBaseGraph< E, W >:

[legend]

Public Types
typedef W	Weight
	Weight type.

typedef Base::Edge	Edge
	Usable edge type.

typedef Base::Vertex	Vertex
	Usable vertex type.

typedef EWBaseGraphRef< E, W >	Graph
	Usable graph type.

typedef EWBaseGraphRef< E, W >	Ref
	Reference type.

Public Types inherited from bio::BaseGraph< E >
typedef E	Edge
	Usable edge type.

typedef Edge::Vertex	Vertex
	Usable vertex type.

typedef BaseGraphRef< E >	Graph
	Usable graph type.

typedef BaseGraphRef< E >	Ref
	Reference type.

Public Member Functions
virtual	~EWBaseGraph ()

virtual void	insert (Edge e, Weight w=(Weight) 0)

virtual Weight	weight (const Edge &e)

virtual Weight	weight (const Edge &e) const

virtual bool	isMinimum (const Graph &g) const

virtual bool	isMinimumSpanningForestRelativeTo (const Graph &h, const Graph &g) const

virtual bool	isMinimumSpanningTree (const Graph &g) const

template<typename Path>
bool	isDescending (const Path &p) const

template<typename Path>
bool	isPathofSteepestdescent (const Path &p) const

template<typename EdgeSet>
bool	isWatershedCut (const EdgeSet &s) const

template<typename EdgeSet>
bool	isBasinCut (const EdgeSet &es) const

virtual Graph	getMinOfF () const

virtual Weight	weight (const Graph &g) const

virtual Weight	Fm (const Vertex &v) const

template<typename G>
W	Fm (const G &thisg, const Vertex &v)

Public Member Functions inherited from bio::BaseGraph< E >
virtual	~BaseGraph ()

virtual void	insert (Vertex v)

virtual void	insert (Edge e)

virtual bool	contains (const Vertex &v) const

virtual bool	contains (const Edge &e) const

virtual bool	empty () const

virtual void	clear ()

virtual bool	operator== (const This &other) const

virtual bool	operator!= (const This &other) const

virtual bool	operator> (const This &other) const

virtual bool	operator< (const This &other) const

virtual bool	operator>= (const This &other) const

virtual bool	operator<= (const This &other) const

virtual bool	operator= (const This &other)

virtual bool	isAdjacent (const Vertex &x, const Vertex &y) const

virtual bool	isLinked (const Vertex &x, const Vertex &y) const

virtual bool	isSubGraph (const Graph &g) const

virtual bool	isConnectedComponent (const Graph &g) const

virtual bool	isAdjacentTo (const Vertex &v, const Graph &g) const

virtual bool	isAdjacentFrom (const Vertex &v, const Graph &g) const

virtual bool	isAdjacent (const Edge &e) const

virtual bool	isLinked (const Vertex &v) const

virtual bool	isExtension (const Graph &h, const Graph &g) const

virtual bool	isForestRelativeTo (const Graph &h, const Graph &g) const

virtual bool	isSpanningForestRelativeTo (const Graph &h, const Graph &g) const

virtual bool	isTree (const Graph &g) const

virtual bool	isSpanningTree (const Graph &g) const

virtual bool	isForest (const Graph &g) const

virtual bool	isSpanningForest (const Graph &g) const

template<typename EdgeIterator>
bool	isGraphCut (EdgeIterator begin, EdgeIterator end, const Graph &g) const

template<typename EdgeSet>
bool	isGraphCut (const EdgeSet &es, const Graph &g) const

Protected Types
typedef EWBaseGraph< E, W >	This
	Type of *this.

typedef BaseGraph< E >	Base
	Base class.

Protected Types inherited from bio::BaseGraph< E >
typedef BaseGraph< E >	This
	Type of *this.

Static Protected Member Functions
template<typename G>
static Weight	Fm (const G &thisg, const Vertex &v)

Static Protected Member Functions inherited from bio::BaseGraph< E >
template<typename G>
static bool	isAdjacent (const G &thisg, const Vertex &x, const Vertex &y)
	These methods are templated on the iterator type (which is implementation dependant and thus not known in BaseGraph).

template<typename G>
static bool	isLinked (const G &thisg, const Vertex &x, const Vertex &y)

template<typename VertexSet, typename G>
static bool	isLinked (const G &thisg, const Vertex &x, const Vertex &y, VertexSet &s)

template<typename G>
static bool	isSubGraph (const G &thisg, const typename G::Ref &g)

template<typename G>
static bool	isConnectedComponent (const G &thisg, const typename G::Ref &g)

template<typename G>
static bool	isAdjacent (const G &thisg, const Edge &e)

template<typename G>
static bool	isAdjacentTo (const G &thisg, const Vertex &v, const typename G::Ref &g)

template<typename G>
static bool	isAdjacentFrom (const G &thisg, const Vertex &v, const typename G::Ref &g)

template<typename G>
static G::Ref	getConnectedComponent (G &thisg, Vertex &v)

template<typename G>
static void	getConnectedComponent (G &thisg, Vertex &v, typename G::Ref &g)

Friends
class	EWBaseGraphRef< E, W >

Additional Inherited Members
Static Public Member Functions inherited from bio::BaseGraph< E >
template<typename Set>
static Set	getComplement (const Set &s, const Set &e)

Detailed Description

template<typename E, typename W>
class bio::EWBaseGraph< E, W >

Base class for edge weighted graphs.

In those graphs, each edge is associated with a value named weight. Several implementations are possible (use of a weighted edge type, use of a map associating edges with weights, ...)

Template Parameters

E	Edge type (prefere RC types)
W	Weight type (S16, S32, ....)

Definition at line 39 of file edgeweightedgraph.h.