procedures for the determination of optimized coupling of nodes in a given graph of possible systems, and the graph is a techniches system

摘要

Using node label functions instead of labels themselves in a procedure aiming at solving the so-called Steiner-tree problem, for example by a process intended to identify the shorter path in a graph, allows for restrictions, either length or time-frame restrictions, to be taken into account when determining cheaper paths.