10. The method as claimed in claim 9 , wherein the shortest hyperpaths are determined by taking account of the two preferences via a label correction algorithm.
10. The method as claimed in claim 9 , wherein the shortest hyperpaths are determined by taking account of the two preferences via a label correction algorithm. 11. The method as claimed in claim 10 , wherein the labels encode pareto-optimal paths to the hitherto found nodes of the hypergraph.