const N_Vertices := 10
include "graph.basic.type.t"
include "graph.mat.wt.type.t" % weighted adjacency matrix types
include "graph.mat.wt.rand.t" % generate a random adjacency matrix
include "graph.mat.wt.put.t" % print an adjacency matrix
include "graph.list.wt.type.t"
include "graph.matTOlist.t" % adjacency matrix -> adjacency list
include "graph.und.prim.t" % Prim's minimum spanning tree
const MaxSetNo := N_Vertices
include "partn.type.t" % partition of the vertices
include "partn.singl.t"
include "partn.merge.t"
include "priority.type.t" % priority queue of edges
include "priority.make.t"
include "priority.first.t"
include "graph.und.krus.t" % Kruskal's minimum spanning tree
var G:GraphA
RandomGraph(G, false)
PutGraph(G, "A Random Weighted Undirected Graph.")
var T:Tree
Prim(G, T)
PutTree(G, T, "Prim's Minimum Spanning Tree.")
var L:GraphL
ConToList(G, L)
Kruskal(L, T)
PutTree(G, T, "Kruskal's Minimum Spanning Tree.")
%\fB Driver for Undirected Graph Routines.\fP