Dijkstra’s Algorithm on Semigraph
Pranjal Sen, Dhruba Jyoti Nath, Abdur Rohman, Surajit Kr. Nath, Moushumi Mitra · WSEAS TRANSACTIONS ON COMPUTER RESEARCH · 2024
The study of graph theory helps us in understanding the relationship between two nodes. Semigraphs are generalizations of graphs where the relationship occurs between more than two nodes. It provides solutions to issues with layout, matching, networking, optimization, etc. To determine the shortest route on a road or network, graph theory can be applied. Google Maps also uses graph theory, and it appears that semigraphs are a more realistic description of the same. In this paper, we investigate how semigraphs determine the shortfall distance using the Google Maps application. Here, we'll use a semigraphic model together with Dijkstra's Algorithm to determine the shortest route between Bodoland University, India, and Basugaon, Assam, India.