Please read the comments in the definitions modules ! Graphs0.df contains 3 packages: FIFOQueue Graphs0 Graphs0Path Disclaimer1 The undirected graph packages have been written for usage by routing packages in the DATools directory; They must not be improved without checking the primary application's implementors. Disclaimer2 The path finding is not optimal, but till now this is not using substantial time for the reouting process. While doing optimizations it should be considered that in the routing application the graphs are NOT arbitrary large, and that the number of arcs typically is less than twice the number of nodes. zGraphs0Doc.tioga Copyright c 1986 by Xerox Corporation. All rights reserved. Created by: Christian Jacobi, September 15, 1986 11:07:56 am PDT Last edited by: Christian Jacobi, October 18, 1986 1:45:42 pm PDT Abstraction for simple first in first out queues of arbitrary length. Can be used either as simple fifo queue abstraction or as a mean to synchronize concurrent processes. Abstraction to define and process undirected graphs sequentially. Simple path finding in undirected graphs. (An application of Graphs0.) Not optional. (Neither speed nor quality of result). Does not care about different "power" requirements. Ê»˜tiogašœ™Icodešœ Ïmœ1™