NAME

Test program for Graph.

SYNOPSIS

perl u_ng_mst.t [ A [ D [ N ] ] ]

DESCRIPTION

This program constructs various trees, embeds them in general graphs, and tests various minimum spanning tree methods: MST_Kruskal, MST_Prim, MST_Dijkstra.

A is arity and it defaults to 4. D is depth and it defaults to 3. N is chain/star size and it defaults to 40. (The minimum is 10.) (To use a default, specify '-'.)

AUTHOR

Nathan Goodman