Mazes, Trees and Graphs (Power Law and Small Word) to test search algorithms

Name: Mazes, Trees and Graphs (Power Law and Small Word) to test search algorithms
Creator: Luiz Mirisola; Rafael Di Piero
Published: 2026-04-17T17:24:54+08:00

IEEE2026-04-17 收录

图算法

算法评估

数据链接：

https://ieee-dataport.org/documents/mazes-trees-and-graphs-power-law-and-small-word-test-search-algorithms 数据链接链接失效反馈

官方服务：

资源简介：

4 kinds of graphs\/trees: Perfect Mazes (i.e., acyclic trees)Random Trees (from networkx)Small world (from networkx)Barabasi-Albert Power Law Graphs (from networkx)seee README.txt for more details about how the graphs were generated. sizes, in number of nodes: 100,250,500,1000,1500 

提供机构：

Luiz Mirisola; Rafael Di Piero

Mazes, Trees and Graphs (Power Law and Small Word) to test search algorithms

资源简介：

相关数据集