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. ˜///route/RouteDiGraphTest.mesa Copyright c 1985 by Xerox Corporation. All rights reserved. Last Edited by: Preas, July 17, 1985 11:44:46 am PDT ʺ˜Jšœ™Jšœ Ïmœ1™