DIMACS Shortest Paths Challenge

该数据集包含了用于实证评估图中寻找k最短路径算法的各种地图。这些地图包括单位成本和非单位成本的版本，并详细列出了每张地图的顶点数和边数。此外，数据集中还包括了一些变体的边成本信息，并考虑了从1到10,000的k值范围。实验是在一台配备8核i7处理器和32GB内存的机器上进行的。数据集规模涵盖不同大小的地图，顶点数量从几十到超过1,000不等，其研究任务是解决k最短路径问题。This dataset contains various maps for the empirical evaluation of k-shortest path finding algorithms on graphs. These maps include both unit-cost and non-unit-cost variants, with the number of vertices and edges of each map explicitly listed. Additionally, the dataset includes edge cost information for several variants, and covers the k value range from 1 to 10,000. The experiments were conducted on a machine equipped with an 8-core i7 processor and 32GB of memory. The dataset encompasses maps of varying sizes, with the number of vertices ranging from tens to over 1,000, and the core research task focuses on solving the k-shortest path problem.

搜集汇总

背景与挑战

背景概述

该数据集是一个实现多种搜索算法的库，用于计算K条最优路径，包含暴力搜索和启发式搜索算法，并提供了多个领域相关的求解器。数据集与ECAI 2024会议论文相关，并提供了相关出版物和数据集的链接。