Technical flow problem resolving method for e.g. telecommunication network, involves selecting n-tuple from set of paths for calculating shortest path between sources and slots in value graph representing flow problem

摘要

The method involves establishing a value graph representing a flow problem characterized by sources and slots. Increment or decrement vectors are transformed into a set of paths between the sources and the slots. An n-tuple is selected from the set of paths for calculating a shortest path between the sources and the slots in the graph of a telecommunication network. An independent claim is also included for a system for resolving a flow problem.