Cart (Loading....) | Create Account
Close category search window

Calculating Shortest Path on Edge-Based Data Structure of Graph

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
GuiLin Chen ; Nanjing Normal Univ., Nanjing ; Mingyong Pang ; Jidong Wang

In this paper, a versatile edge-centered data structure is presented based on an analysis about classical representations of graph or network topology. The data structure has many good properties of convenient data accessing, compact topological representation and intuitionistic graph operating, and so on. Further, the data structure has capabilities of representing various networks with arbitrary complexity and topology and implementing codes of various graph algorithms with easy and efficient way. Based on the data structure and the breadth-first traversal strategy, an algorithm is proposed and built for efficiently calculating the shortest path between an given vertex and each other vertex in even very large-scale graph. Experiments and results show that our data structure has the better performance about time and space. It can act as basic data structure in implementations of various graph algorithms and in related applications.

Published in:

Digital Media and its Application in Museum & Heritages, Second Workshop on

Date of Conference:

10-12 Dec. 2007

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.