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.

There is no tag wiki for this tag … yet!

Tag wikis help introduce newcomers to the tag. They contain an overview of the topic defined by the tag, along with guidelines on its usage.

All registered users may propose new tag wikis.

(Note that if you have less than 4000 reputation, your tag wiki will be peer reviewed before it is published.)

history | excerpt history