graphutilities.H File Reference

#include <types.H>
#include <array.H>
#include <list.H>
#include <queue.H>
#include <map.H>
#include <heap.H>

Include dependency graph for graphutilities.H:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
class	Designar::CommonNodeArc
class	Designar::Path< GT >
class	Designar::MinPathNodeInfo< GT, Distance >
class	Designar::MinPathArcInfo< GT, Distance >
class	Designar::GetPot< GT, Distance >
class	Designar::DftGridNodeInit< GT >
class	Designar::DftGridArcInit< GT >
class	Designar::DftNodeInit< GT >
class	Designar::DftArcInit< GT >
class	Designar::DftNodeOutput< GT >
class	Designar::DftArcOutput< GT >
class	Designar::DftGraphOutput< GT >
class	Designar::DftNodeInput< GT >
class	Designar::DftArcInput< GT >
class	Designar::DftGraphInput< GT >
class	Designar::DftDotNodeAttr< GT >
class	Designar::DftDotArcAttr< GT >
class	Designar::DftDotGraphAttr< GT >

Namespaces
	Designar

Typedefs
template<class GT >
using	Designar::Node = typename GT::Node
template<class GT >
using	Designar::Arc = typename GT::Arc
template<class GT >
using	Designar::NodeIt = typename GT::NodeIterator
template<class GT >
using	Designar::ArcIt = typename GT::ArcIterator
template<class GT >
using	Designar::AdArcIt = typename GT::AdjacentArcIterator

Enumerations
enum	Designar::GraphTag : nat_t {   Designar::GraphTag::DEPTH_FIRST = 1, Designar::GraphTag::BREADTH_FIRST = 2, Designar::GraphTag::KRUSKAL = 4, Designar::GraphTag::PRIM = 8,   Designar::GraphTag::DIJKSTRA = 16, Designar::GraphTag::ASTAR = 32, Designar::GraphTag::SPANNING_TREE = 64, Designar::GraphTag::MIN_SPANNING_TREE = 128,   Designar::GraphTag::COMPONENT = 256, Designar::GraphTag::CUT = 512, Designar::GraphTag::PATH = 1024, Designar::GraphTag::MIN_PATH = 2048,   Designar::GraphTag::MIN_PATH_TREE = 4096 }

Functions
void	Designar::map_graph_item (CommonNodeArc *x, CommonNodeArc *y)
template<class SG , class TG = SG>
void	Designar::map_nodes (Node< SG > *p, Node< TG > *q)
template<class SG , class TG = SG>
void	Designar::map_arcs (Arc< SG > *a, Arc< TG > *b)
template<class SG , class TG = SG>
TG::Node *	Designar::mapped_node (Node< SG > *p)
template<class SG , class TG = SG>
TG::Arc *	Designar::mapped_arc (Arc< SG > *a)
template<class GT >
lint_t &	Designar::df (Node< GT > *p)
template<class GT >
lint_t &	Designar::low (Node< GT > *p)
template<class GT , class Distance >
MinPathNodeInfo< GT, Distance > *&	Designar::NI (Node< GT > *p)
template<class GT , class Distance >
Node< GT > *&	Designar::TREE_NODE (Node< GT > *p)
template<class GT , class Distance >
Distance::Type &	Designar::ACC (Node< GT > *p)
template<class GT , class Distance >
MinPathArcInfo< GT, Distance > *&	Designar::AI (Arc< GT > *a)
template<class GT , class Distance >
Arc< GT > *&	Designar::TREE_ARC (Arc< GT > *a)
template<class GT , class Distance >
Distance::Type &	Designar::POT (Arc< GT > *a)
template<class GT , class Distance >
bool &	Designar::IS_IN_QUEUE (Arc< GT > *a)
template<class GT , class Distance >
void	Designar::allocate_node_info (const GT &g)
template<class GT , class Distance >
void	Designar::allocate_arc_info (const GT &g)
template<class GT , class Distance >
void	Designar::destroy_node_info (const GT &g)
template<class GT , class Distance >
void	Designar::destroy_arc_info (const GT &g)
template<class GT , class Distance , class Heap >
void	Designar::put_in_heap (Arc< GT > *a, Node< GT > *t, Heap &h)
template<class GT , class Distance , class Heap >
Arc< GT > *	Designar::get_from_heap (Heap &h)