超图数据存储技术研究与实现0518.docxVIP

超图数据存储技术研究与实现摘要一直以来，图作为离散数学中的一个典型的对网络进行抽象数学模型，在计算机网络领域和通信领域得到了非常广泛的应用。图中的最短路径问题也一直是图论中的经典问题，在图形学中的图像分割、通信学中的导航系统、城市规划学中的城市交通规划设计等领域都有着很高的应用价值和理论研究价值。超图作为图的一个有效扩展，近几年在这些领域中已经随着系统规模的扩大而被引入，然而基于超图的许多相关课题还在进一步研究之中，尤其是基于超图路径的最短路径问题，一直是目前超图应用领域中的热点研究问题。本文就是在图论和超图相关理论的基础之上，结合超图数据的特性，就超图中的最短路径求解算法进行相关研究，通过将一些现有问题进行分析讨论，来丰富超图理论及提供其在具体应用中的技术支持。本文首先介绍了图论和超图的相关研究背景，并简要说明了一些基本概念，其次，在这些基本概念的基础之上，重点分析了超图中的最短路径问题，并针对此问题提出并设计了超图最短路径求解算法及实例。最后，通过具体实现的算法将现有的超图数据进行应用，取得了很好的实验结果，验证了超图最短路径算法的有效性和适用性。关键字：超图；最短路径；Floyd算法AbstractFor a long time, graph, as a typical mathematical model of discrete mathematics, has been widely applied in the field of computer network and communication. The shortest path problem in a graph is a classic problem in graph theory, the field of city image segmentation, communication in graphics in the city planning and navigation system in the traffic planning and design has a value of application value and theoretical research is very high. As an effective extension of hypergraph mapping, in recent years in these areas have been expanding with the scale of the system is introduced, however further studies based on many related topics in the hypergraph, especially the shortest path problem based on Hypergraph path, has been a hotspot in the research of application in the field of hypergraph.This paper is related in graph and hypergraph theory foundation, combined with the characteristics of the related research on the hypergraph data, the shortest path algorithm of hypergraph, some existing problems were analyzed and discussed, to enrich the hypergraph theory in its application and provide technical support. This paper first introduces the research background of graph and hypergraph, and a brief description of some basic concepts, secondly, on the basis of these basic concepts, focuses on the analysis of the shortest path problem in hypergraph, and put forward to solve this problem and designed a hypergraph shortest path algorithm and examples. Finally, the existing