printf("TopologicalOrderTraversal\n");
$g->topologicalOrderTraversal(new PrintingVisitor(STDOUT));
printf("isCyclic returns %s\n", str($g->isCyclic()));
printf("isStronglyConnected returns %s\n", str($g->isStronglyConnected()));
}
/**
* Weighted graph test method.
*
* @param object IDigraph $g The weighted graph to test.
*/
public static function testWeighted(IDigraph $g)
{
printf("Weighted digraph test program.\n");
AbstractGraph::testWeighted($g);
}
/**
* Main program.
*
* @param array $args Command-line arguments.
* @return integer Zero on success; non-zero on failure.
*/
public static function main($args)
{
printf("AbstractDigraph main program.\n");
$status = 0;
return $status;
}
}
if (realpath($argv[0]) == realpath(__FILE__)) {
exit(AbstractDigraph::main(array_slice($argv, 1)));
}
/**
* Main program.
*
* @param array $args Command-line arguments.
* @return integer Zero on success; non-zero on failure.
*/
public static function main($args)
{
printf("DigraphAsMatrix main program.\n");
$status = 0;
$g = new DigraphAsMatrix(4);
AbstractDigraph::test($g);
$g->purge();
AbstractDigraph::testWeighted($g);
$g->purge();
return $status;
}
