Network instance Chordal, fixed size, edition 2

Chordal graphs from a self-written generator. The weights of the constraint arcs are set such that at least one solution exists (i.e. the graph contains no negative cycles and the STN is consistent). This archive contains 250 graphs on 1000 vertices, 75840–499490 edges, treewidth 79–995. Parent item: Benchmark instances for experiments in ["Computing All-Pairs Shortest Paths by Leveraging Low Treewidth" (paper, 2012)]本数据集通过自研生成器生成弦图（Chordal Graphs）。约束弧的权重设置需确保至少存在一个可行解，即该图不含负环且STN具备一致性。本数据集共包含250张含1000个顶点的图，单图边数范围为75840至499490，树宽（treewidth）范围为79至995。本数据集的父项为2012年发表的论文《Computing All-Pairs Shortest Paths by Leveraging Low Treewidth》中实验所用的基准测试实例。