DigraphTypes

Detailed Description

Classes
class	Diedge< NodeT, WeightT >
	Non-oriented edge. More...
class	Digraph< NodeT, WeightT >
	Non-oriented Digraph. More...

Functions
template<class NodeT , class WeightT >
bool	operator== (const vector< Diedge< NodeT, WeightT >> &e1, const vector< Diedge< NodeT, WeightT >> &e2)
	Check if two vectors of edges are equal.
template<class digraphT >
digraphT	digraphMST (const digraphT &graph)
	graphMST() - create a Mininum Spanning Tree More...

Function Documentation

digraphMST()

digraphT smil::digraphMST

(

const digraphT &

graph

)

graphMST() - create a Mininum Spanning Tree

Parameters

[in]

graph

: input graph

Returns

Minimum Spanning Tree built from input graph