Samenvatting
Modal split and traffic assignment are both basic steps of a Y traffic study for which new approaches may imply the computation of the k shortest chains between an origin O and a destination D. In this paper an algorithm is given to find the K shortens chains in a graph G.