A graphical representation of a problem by means of nodes connected by arcs of varying length or capacity. The arcs are usually directed. Examples include finding the shortest path between two nodes, finding the shortest set of arcs that connects all the nodes, the Chinese postman problem, and the travelling salesman problem. See also critical path analysis; network flow problems; reliability theory.
Subjects: Probability and Statistics.