Pawan Kumar

Entropy Maximization Problem in Network using Dijkstra’s-Floyd Warshall Algorithm

2019 · International Journal of Computer Applications

The shortest path problem is to find a path between two vertices on a given graph, such that the sum of the weights on its constituent edges is minimized. The classic Dijkstra's algorithm was designed …