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