基于有向循环图的迷宫问题求解
solution for maze problem based on Circulant Digraphs
图是用于描述现实世界中离散客体之间关系的有用工具，有向循环图是图论的重要研究内容。迷宫问题在《数据结构》中是作为栈与队列应用举例的经典的程序设计问题。本文讨论了基于有向循环图的顶点（离散客体）与边（客体间连通性）的性质，迷宫问题在有向循环图上的可适用性，以及有向循环图的迷宫问题求解的实际应用价值。
iagraphs is the useful tool for describing relations between dispersed objects in the real world.And circulant digraphs is the core research-content of Graph Theory.While as a classic programming problem,Maze problemis an example for stack and queue in <Data Structure>.In this paper,follows are researched:Maze problem\\\
夏青
数学计算技术、计算机技术
有向循环图迷宫问题可达性矩阵warshall算法回路死结点等价
circulant digraphsmaze problemreachability matrixwarshall algotithmcircuitblind- alleyequal
夏青.基于有向循环图的迷宫问题求解[EB/OL].(2008-07-31)[2025-08-16].http://www.paper.edu.cn/releasepaper/content/200807-579.点此复制
评论