1990•Unpublished venueRequires access
Graph Traversals and Algorithms
Manoochehr Azmoodeh
Open publisher page 0 citations
Abstract
In this chapter we will discuss two systematic and structured methods of traversing the nodes and arcs of a graph. These traversal techniques can then be used as a powerful algorithm design tool on graph data types. These are indeed generalisations of the tree traversal methods which were used as a basis of efficient algorithms on trees. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.