Prim's algorithm

About: Prim's algorithm is a research topic. Over the lifetime, 775 publications have been published within this topic receiving 17971 citations. The topic is also known as: DJP algorithm & Jarník algorithm.

The Realization and Analysis of Prim's Algorithm

Abstract: Prim's Algorithm is used the most frequently in constructing the minimum-cost spanning tree of the graph.The paper aims to introduce the approach to realization of Prim's Algorithm and makes an analysis of its efficiency.

A fast approximation algorithm for maximum-leaf spanning tree

Abstract: Given an undirected graph G, finding a spanning tree of G with maximum number of leaves is not only NP-complete but also MAX SNP-complete. The approximation ratio of the previously best known approximation algorithm for maximum leaf spanning tree is three. However, the high-order running time required by the previous algorithm makes it impractical. In this paper we give a new factor-three approximation algorithm for the same problem. The running time O((m+n)/spl alpha/(m, n)) required by our algorithm is almost linear in the size of G, where m is the number of edged and n is the number of nodes. This improves the previous algorithm by a factor of /spl Omega//spl tilde/(mn/sup 4/).

An Optimal Path Planning Algorithm For Large Virtual Environment

Abstract: Path planning algorithm is a typical algorithm applied in many fields of research specifically in robotic, games and virtual environment. Meanwhile, virtual environment (VE) is a leading edge technology that can add realistic visualization of real world. Interaction within a VE requires animated characters to participate in such a way that, they be able to navigate as well as plan the tour. Shortest path and obstacle avoidance are two frequent parameters in path planning for the movement of animated character. Specifically in virtual exhibition area normally visitor involves touring to more than one site. Furthermore, in a large scale of VE the results may entail a problematical and complex navigational algorithm. Therefore, this research is aim to integrate a path finding, path planning and path optimization algorithm to produce an efficient optimal route tour in VE. The optimal route tour in this work is based on three consideration criteria. There are shortest distance, crowd avoidance and small scale search area. Prim algorithm is applied in order to generate the optimal sequence of tour based on above criteria. A* algorithm is used as a path finding technique to supply the shortest distance also plan a collision free path from one location to another. Moreover, Cell Mapping technique is used to optimize the utilization of search area as well as enhance the search performance. The enhancement algorithm then is used to be more flexible and adaptive in various layout and large scale VE. Meanwhile, virtual exhibition area has been adopted as a domain to execute the algorithm. The result shows that algorithm capable to minimize travel cost while maximize the purpose of visit in the expandable huge virtual environments.

Neighborhood storage method and device

Abstract: Embodiments of the invention provide a neighborhood storage method and device. The method comprises the following steps of obtaining an undirected weighted graph according to an obtained network topological graph; generating an initial neighborhood matrix according to the undirected weighted graph, obtaining an isolated node and a non-isolated initial node with the least neighbor nodes, and addingthe isolated node and the non-isolated initial node into an initial node sequence set; sequentially adding nodes to be added in the undirected weighted graph into the initial node sequence set by adopting a Prim algorithm on the basis of the initial node sequence set in order to obtain a target node sequence set, wherein the nodes to be added are nodes which do not join the initial node sequenceset in the undirected weighted graph, and the sequence of the non-isolated nodes in the target node sequence set corresponds to the node adding sequence, and the isolated node is not located between the non-isolated nodes; and adjusting the initial neighborhood matrix according to the sequence of the nodes in the target node sequence set in order to obtain a target node neighbor matrix. Therefore,the target node neighbor matrix in a neighborhood set can be obtained.