geos::planargraph Namespace Reference

Contains classes to implement a planar graph data structure. More...

Namespaces
	algorithm
	Planargraph algorithms.

Classes
class	DirectedEdge
	Represents a directed edge in a PlanarGraph. More...
class	DirectedEdgeStar
	A sorted collection of DirectedEdge which leave a Node in a PlanarGraph. More...
class	Edge
	Represents an undirected edge of a PlanarGraph. More...
class	GraphComponent
	The base class for all graph component classes. More...
class	Node
	A node in a PlanarGraph is a location where 0 or more Edge meet. More...
class	NodeMap
	A map of Node, indexed by the coordinate of the node. More...
class	PlanarGraph
	Represents a directed graph which is embeddable in a planar surface. More...
class	Subgraph
	A subgraph of a PlanarGraph. More...

Functions
bool	pdeLessThan (DirectedEdge *first, DirectedEdge *second)
	Strict Weak comparator function for containers. More...
std::ostream &	operator<< (std::ostream &, const DirectedEdge &)
	Output operator. More...
std::ostream &	operator<< (std::ostream &os, const Edge &n)
	Print a Edge. More...
std::ostream &	operator<< (std::ostream &os, const Node &n)
	Print a Node. More...

Detailed Description

Contains classes to implement a planar graph data structure.

Function Documentation

std::ostream& geos::planargraph::operator<<	(	std::ostream &	os,
		const Edge &	n
	)

Print a Edge.

std::ostream& geos::planargraph::operator<<	(	std::ostream &	os,
		const Node &	n
	)

Print a Node.

std::ostream& geos::planargraph::operator<<	(	std::ostream &	,
		const DirectedEdge &
	)

Output operator.

Referenced by geos::planargraph::Edge::Edge(), and geos::planargraph::Node::getIndex().

Here is the caller graph for this function:

bool geos::planargraph::pdeLessThan	(	DirectedEdge *	first,
		DirectedEdge *	second
	)

Strict Weak comparator function for containers.