This section provides discussion and source code for the GraphAlgorithm extensions currently available in the NetWorKs program. It is important to note that writing code to illustrate a graph (network) algorithm is very different from writing code to perform a graph algorithm. In particular, when implementing algorithms time complexity is a major issue. But for illustration, time complexity is a relatively minor issue since algorithms are completed stepwise and the displayed graph will be relatively small. The major issues in illustration are that the display clearly demonstrates the steps, and that the text explanation is clear, concise, and accurate. To accomplish this it may be that a GraphAlgorithm is implemented very differently than the graph algorithm it illustrates.
The currently available GraphAlgorithm extensions are the Topological, Kruskal, Dijkstra, and DepthFirst classes.