The Search for Extremal Paths on a Finite Graph

A relief is considered as a set of extremal paths on a finite graph (possibly a multigraph with loops). Conditions are formulated by which the relief may be constructed by a simple computational procedure. Corresponding algorithms and examples of their application are given.