---

tools/SDAGUtils.cpp File Reference

#include <LEDA/array.h>
#include <LEDA/stack.h>
#include "SDAGUtils.h"

Include dependency graph for SDAGUtils.cpp:

Functions
bool	TOPSORT (const leda_graph &G, leda_node_array< int > &ord)
int	COMPONENTS (const leda_graph &G, leda_node_array< int > &compnum)
void	inverseTopSort (const leda_graph &g, leda_node_array< int > &ret)
leda_node	isInTree (const leda_graph &g)
leda_node	isOutTree (const leda_graph &g)

---

Function Documentation

int COMPONENTS (  const leda_graph &    G, leda_node_array< int > &    compnum )

void inverseTopSort (  const leda_graph &    g, leda_node_array< int > &    ret )

leda_node isInTree (  const leda_graph &    g )

check if a directed graph is a in-tree Returns: the root of the intree (or NULL if g is not an in-tree)

leda_node isOutTree (  const leda_graph &    g )

check if a directed graph is a out-tree Returns: the root of the outtree (or NULL if g is not an out-tree)

bool TOPSORT (  const leda_graph &    G, leda_node_array< int > &    ord )

---