Abstract: In this paper, we introduce a distributed algorithm for single source shortest path problem for undirected graphs. In this problem, we find the shortest path from a given source node to ...

I do .NET for living and try to write code I am not be ashamed of :) ...

Abstract: This article introduces the problem of parallelization of Dijkstra's algorithm, a well known algorithm for computing single-source shortest path in a graph. Dijkstra's algorithm can be ...

A visualisation React app to view the nature of Graph algorithms on the obstructed 2D grid, implemented bunch of maze generation algorithms and path finding algorithms. Algorithms Implemented: ...

Implemented a system to find the shortest distance among a set of cities using Kruskal’s Algorithm and Priority Queue in Java.

Congestion is a dynamic phenomenon and hence efficiently computing alternate shortest route can only help expedite decongestion. This research is aimed to efficiently compute shortest path for road ...

Computing driving directions has motivated many shortest path algorithms based on preprocessing. Given a graph, the preprocessing stage computes a modest amount of auxiliary data, which is then used ...

We present a novel approach for computing a shortest path in a mixed fuzzy network, network having various fuzzy arc lengths. First, we develop a new technique for the addition of various fuzzy ...