For questions related to the planing of paths through a tree or network of vertices connected by edges, whereby there is some set of objectives that the plan is constructed to meet. Such objectives could be as simple as arrival at one of a set of vertices or as complex as a function determined by some function applied to the entire plan. The state of the tree or network and the value of particular edge traversals may be either static or dynamic.