ecolab::Graph Struct Reference

#include <graph.h>

Inheritance diagram for ecolab::Graph:

Collaboration diagram for ecolab::Graph:

Classes
class	const_iterator
	iterator over edges More...
struct	const_iterator_base

Public Types
typedef Edge	value_type
typedef std::size_t	size_type
typedef std::ptrdiff_t	difference_type
typedef Edge &	reference
typedef const Edge &	const_reference

Public Member Functions
virtual const_iterator	begin () const =0
	iterator to first edge
virtual const_iterator	end () const =0
	iterator beyond last edge
virtual unsigned	nodes () const =0
	number of nodes
virtual unsigned	links () const =0
	number of links
virtual void	push_back (const Edge &e)=0
	add an edge. Node count is adjusted so that edge is valid.
template<class BG >
void	push_back (const typename BG::edge_iterator::value_type &e)
	support for Boost Graph Library
virtual bool	contains (const Edge &e) const =0
	true if graph contains e
virtual bool	directed () const =0
	true if a bidirectional graph (all edges go both ways)
virtual void	clear (unsigned nodes=0)=0
	remove all edges from the graph and set the node count
void	Clear (TCL_args args)
const Graph &	operator= (const Graph &x)
template<class BG >
Graph_back_insert_iterator< Graph, BG >	back_inserter (const BG &bg)
void	input (const std::string &format, const std::string &filename)
	available formats pajek, lgl, dot, gengraph (input only)
void	output (const std::string &format, const std::string &filename) const

Detailed Description

Abstract base class for graph algorithms.

Member Function Documentation

back_inserter()

template<class BG >

Graph_back_insert_iterator<Graph,BG> ecolab::Graph::back_inserter ( const BG &  bg )

inline

output iterator for constructing a Graph object from a boost graph algorithm

---

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

• include/graph.h