MAXIMUM SUM ARRAY FIRST SEARCH ALGORITHM FOR GRAPH TRAVERSAL

Abstract

Graphs are the commonly used data structures that describe a set of objects as nodes and the connections between them as edges. Graph traversal is a technique to find all nodes reachable from a given set of root nodes. To traverse a graph is to process every node in the graph exactly once. The two most widely used algorithms used for traversing a graph are Breadth First Search and Depth First Search. This paper presents a new algorithm namely maximum sum array first search algorithm for traversing a graph. In this algorithm the node with the maximum number of edges if processed first and then its neighboring nodes are processed. This paper presents an algorithm to traverse an undirected or a directed graph and calculates the time and space complexity of the algorithm. The objective of proposed algorithm is to find a new alternative algorithm that can be applied to all types of graphs.