///route/RouteDiGraphTest.mesa
Copyright © 1985 by Xerox Corporation. All rights reserved.
Last Edited by: Preas, July 17, 1985 11:44:46 am PDT
DIRECTORY
List,
Rope,
RouteDiGraph;
RouteDiGraphTest: CEDAR PROGRAM
IMPORTS RouteDiGraph =
BEGIN
gn: Rope.ROPE ← "Test";
graph: RouteDiGraph.Graph ← RouteDiGraph.CreateGraph[graphInfo: gn];
n1: Rope.ROPE ← "node1";
node1: RouteDiGraph.Node ← RouteDiGraph.AddNewNode[graph: graph, nodeInfo: n1];
n2: Rope.ROPE ← "node2";
node2: RouteDiGraph.Node ← RouteDiGraph.AddNewNode[graph: graph, nodeInfo: n2];
arc: RouteDiGraph.Arc ← RouteDiGraph.AddNewArc[graph: graph, superiorNode: node2, inferiorNode: node1];
RouteDiGraph.WriteNodes[graph, RouteDiGraph.SimpleListNodeProc, RouteDiGraph.SimpleListArcNodeProc];
END.