model_server/edge/src/sugitopsort.cxx
/*
 * TopSort
 *	Does a topological sort of the graph.  
 *	Some nodes are flexible as to what level they are assigned to.
 *	TopSortTop tends to put nodes near level 0
 *	TopSortBottom tends to put nodes near max level
 */
TopSort
Does a topological sort of the graph.
Some nodes are flexible as to what level they are assigned to.
TopSortTop tends to put nodes near level 0
TopSortBottom tends to put nodes near max level
TopSort Does a topological sort of the graph . Some nodes are flexible as to what level they are assigned to . TopSortTop tends to put nodes near level 0 TopSortBottom tends to put nodes near max level
void TopSort(graph* g)
{
    if (g->gettopsort() == high)
	TopSortTop(g);
    else if (g->gettopsort() == low)
	TopSortBottom(g);
    else
	TopSortTop(g);
}
void TopSort ( graph * g ) { if ( g -> gettopsort ( ) == high ) TopSortTop ( g ) ; else if ( g -> gettopsort ( ) == low ) TopSortBottom ( g ) ; else TopSortTop ( g ) ; }
TopSort
      Does a topological sort of the graph.
TopSort Does a topological sort of the graph .