CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Optimized Proposed Algorithm for Graph Traversal

by Ankit Malhotra, Dipit Malhotra, Saksham Kashyap
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 104 - Number 9
Year of Publication: 2014
Authors: Ankit Malhotra, Dipit Malhotra, Saksham Kashyap
10.5120/18234-9217

Ankit Malhotra, Dipit Malhotra, Saksham Kashyap . Optimized Proposed Algorithm for Graph Traversal. International Journal of Computer Applications. 104, 9 ( October 2014), 38-43. DOI=10.5120/18234-9217

@article{ 10.5120/18234-9217,
author = { Ankit Malhotra, Dipit Malhotra, Saksham Kashyap },
title = { Optimized Proposed Algorithm for Graph Traversal },
journal = { International Journal of Computer Applications },
issue_date = { October 2014 },
volume = { 104 },
number = { 9 },
month = { October },
year = { 2014 },
issn = { 0975-8887 },
pages = { 38-43 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume104/number9/18234-9217/ },
doi = { 10.5120/18234-9217 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:35:45.522916+05:30
%A Ankit Malhotra
%A Dipit Malhotra
%A Saksham Kashyap
%T Optimized Proposed Algorithm for Graph Traversal
%J International Journal of Computer Applications
%@ 0975-8887
%V 104
%N 9
%P 38-43
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper includes a flexible algorithm for traversing a directed and an undirected graph. Graph traversal is defined as the problem of visiting all the nodes in a graph in a particular manner, updating and/or checking their values along the way. The Breadth first search along with Depth first search are the most widely used algorithms for traversing a graph. In this article, an algorithm is proposed for traversing a graph taking in consideration the vertex with the maximum outgoing edges. Instead of beginning from the root node and then gaining access to visit the neighbors of the currently visited node, the algorithms looks for the vertex with the maximum edges and then continue traversing all the neighboring vertices of that vertex. This paper presents an algorithm to traverse an undirected or a directed graph and calculates the time and space complexity of the algorithm. The work proposed here intends to find a new algorithm that can be universally applied to all types of graphs

References
  1. Applications of graph theory in communication networks by Suman Deswal.
  2. Shortest path algorithm in GIS network analysis based on Clifford algebra by Jiyi Zhang, Weichang, Mei, Wen Luo, Linwang Yuan.
  3. Graph theory and applications by Paul Van Dooren
  4. Applications of graph theory by S. G. Shirinivas S. Vetrivel , Dr. N. M. Elango
  5. BFS by Allison June Barlow Chaney,Princeton. edu.
  6. DFS by Allison June Barlow Chaney.
  7. Introduction to Algorithms(2nd ed) by Cormen Thomas H, Leiserson , Charles E,Clifford(2001)
  8. Breadth First Search WIKIPEDIA
  9. CMU-Data Structures Lessons 5
  10. Graphs :Representation and Exploration by Julian Mestre
  11. Y. T. Yu, M. F. Lau, "A comparison of MC/DC, MUMCUT and several other coverage criteria for logical decisions", Journal of Systems and Software, 2005, in press.
  12. Spector, A. Z. 1989. Achieving application requirements. In Distributed Systems, S. Mullender
Index Terms

Computer Science
Information Sciences

Keywords

Keywords are your own designated keywords which can be used for easy location of the manuscript using any search engines.

Powered by PhDFocusTM