A Graph Theory Package for Maple
Jeffrey B. Farr, Mahdad Khatirinejad, Sara Khodadad, Michael Monagan · 2005
We present a new graph theory package for Maple. The package is presently intended for teaching and research usage, and expected to treat graphs of up to 1000 vertices in a reasonable time. The current tool in Maple for solving problems in graph theory is the networks package. This package is over ten years old and is designed primarily with applications of networks in mind. The data structure is too heavy and cumbersome for treating elementary graph theory problems. Therefore, one design criterion for the new GraphTheory package is a simple, yet flexible, data structure designed primarily for solving problems related to graphs rather than networks. All of the operations present in the networks package and all of the standard operations for graphs are, however, available in the GraphTheory package. The package includes a drawing algorithm. The following example shows how one can find a spanning tree of a random graph which has 15 vertices and every edge is present with probability 0.3:> G: = RandomGraph(15,.3);