NETWORK DESIGN EVALUATION METHOD, NETWORK DESIGN EVALUATION DEVICE, AND PROGRAM

摘要

An object is to provide a network design evaluation method, a network design evaluation apparatus, and a program with the ZDD algorithm for finding all edge-disjoint paths in a given graph G within a finite time. A network design evaluation method according to the present invention includes extracting all paths for each specified pair of vertices in a given graph in the frontier-based search, representing a set of paths having, as elements, the paths extracted for each pair of vertices in a ZDD, and performing a disjoint join operation for all the sets of paths represented in ZDDs, to thereby extract edge-disjoint paths.