Degree Based Search: A Novel Graph Traversal Algorithm Using Degree Based Priority Queues

This paper introduces a novel graph traversal algorithm, Degree Based Search, which leverages degree-based ordering and priority queues to efficiently identify shortest paths in complex graph structures. Our method prioritizes nodes based on their degrees, enhancing exploration of related components and offering flexibility in diverse scenarios. Comparative analysis demonstrates superior performance of Degree Based Search in accelerating path discovery compared to traditional methods like Breadth First Search and Depth First Search. This approach improves exploration by focusing on related components. Using a priority queue ensures optimal node selection; the method iteratively chooses nodes with the highest or lowest degree. Based on this concept, we classify our approach into two distinct algorithms: the Ascendant Node First Search, which prioritizes nodes with the highest degree, and the Descent Node First Search , which prioritizes nodes with the lowest degree. This methodology offers diversity and flexibility in graph exploration, accommodating various scenarios and maximizing efficiency in navigating complex graph structures. The study demonstrates the Degree based Searching algorithm’s efficacy in accelerating path discovery within graphs. Experimental validation illustrates its proficiency in solving intricate tasks like detecting communities in Facebook networks. Moreover, its versatility shines across diverse domains, from autonomous driving to warehouse robotics and biological systems. This algorithm emerges as a potent tool for graph analysis, efficiently traversing graphs and significantly enhancing performance. Its wide applicability unlocks novel possibilities in various scenarios, advancing graph-related applications.