br_stl Namespace Reference

Classes
class	checkedVector
struct	IterGreater
class	dynamic_priority_queue
struct	Empty
class	Graph
Enumerations
enum	VertStatus { notVisited, visited, processed }
Functions
template<class GraphType , class EdgeType >
void	Dijkstra (GraphType &Gr, std::vector< EdgeType > &Dist, std::vector< int > &Pred, int Start)
template<class GraphType >
bool	topoSort (GraphType &G, std::vector< int > &Result)
std::string	i2string (unsigned int i)
template<class EdgeType >
void	create_vertex_set (Graph< Place, EdgeType > &G, int count, int maxX, int maxY)
template<class EdgeType >
void	connectNeighbors (Graph< Place, EdgeType > &G)
template<class EdgeType >
void	createTeXfile (const char *Filename, Graph< Place, EdgeType > &G, double ScalingFactor, int xMax, int yMax)
template<class EdgeType >
void	createMPfile (char *Filename, Graph< Place, EdgeType > &G, double ScalingFactor)
template<class EdgeType >
void	writeMPpath (char *Filename, Graph< Place, EdgeType > &G, std::vector< int > &V, double ScalingFactor, int Start)
std::ostream &	operator<< (std::ostream &os, const Empty &)
std::istream &	operator>> (std::istream &is, Empty &)
template<class VertexType , class EdgeType >
std::ostream &	operator<< (std::ostream &os, Graph< VertexType, EdgeType > &G)
template<class Container >
void	showSequence (const Container &s, const char *sep=" ", std::ostream &where=std::cout)

---

Enumeration Type Documentation

enum br_stl::VertStatus

Enumerator:

notVisited
visited
processed

---

Function Documentation

template<class EdgeType >

void br_stl::connectNeighbors

(

Graph< Place, EdgeType > &

G

)

template<class EdgeType >

void br_stl::create_vertex_set	(	Graph< Place, EdgeType > &	G,
		int	count,
		int	maxX,
		int	maxY
	)

template<class EdgeType >

void br_stl::createMPfile	(	char *	Filename,
		Graph< Place, EdgeType > &	G,
		double	ScalingFactor
	)

template<class EdgeType >

void br_stl::createTeXfile	(	const char *	Filename,
		Graph< Place, EdgeType > &	G,
		double	ScalingFactor,
		int	xMax,
		int	yMax
	)

template<class GraphType , class EdgeType >

void br_stl::Dijkstra	(	GraphType &	Gr,
		std::vector< EdgeType > &	Dist,
		std::vector< int > &	Pred,
		int	Start
	)

std::string br_stl::i2string

(

unsigned int

i

)

std::ostream& br_stl::operator<<	(	std::ostream &	os,
		const Empty &
	)		[inline]

template<class VertexType , class EdgeType >

std::ostream& br_stl::operator<<	(	std::ostream &	os,
		Graph< VertexType, EdgeType > &	G
	)

std::istream& br_stl::operator>>	(	std::istream &	is,
		Empty &
	)		[inline]

template<class Container >

void br_stl::showSequence	(	const Container &	s,
		const char *	sep = " ",
		std::ostream &	where = std::cout
	)

template<class GraphType >

bool br_stl::topoSort	(	GraphType &	G,
		std::vector< int > &	Result
	)

template<class EdgeType >

void br_stl::writeMPpath	(	char *	Filename,
		Graph< Place, EdgeType > &	G,
		std::vector< int > &	V,
		double	ScalingFactor,
		int	Start
	)