Next: Searches and Sorts Up: Graph Algorithms Previous: Graph Algorithms

## Algorithm Specifications

The following list enumerates the algorithms which are currently callable from the GUI interface, and those which we anticipate will be included in the July 31st relase of the system. The algorithm animations may be called and viewed, as in any animation system, but the results (in the form of the return value and any attributes set) can be obtained for further use in the Scheme interface. For example, selecting Kruskal from the Algorithm menu runs Kruskal's minimum spanning tree animation, but the return value can be saved and used by calling the same algorithm from the command-line interface (see the User's Manual on Page ). For example, a command to bring up a the spanning tree of a graph g is:

              (show-labeled-graph (graph (vertices g) (kruskal g))).

Each algorithm below is listed by its Scheme command name (and alias if appropriate). The return values can be retrieved by calling the algorithms from Scheme (as above), and the values of the attributes set by algorithms can also be retrieved using Scheme. See the User's Manual for a discussion of this (NOT WRITTEN YET 7/19/96). It would be straightforward to incorporate the retrieval and setting of all fundamental attributes through the graph menu, but this has not been done for all of them yet. However, color, vertex size, edge width, and vertex and edge labels are easily changed from the GUI interface.

- Searches and Sorts
- Components
- Shortest Paths
- Minimum Spanning Tree
- Network Flows and Matching

Next: Searches and Sorts Up: Graph Algorithms Previous: Graph Algorithms