Short Path Problem

Consider the problem of finding the shortest path between nodes s and t in a graph (directed or undirected).there are two algorithm
1. Dijkstra s algorithm
2. Floyd s algorithm
Dijkstra s algorithm is designed to determine the shortest routes between the
source node and every other node in the network. Floyd s algorithm is more general
because it allows the determination of the shortest route between any two nodes in the network.
Dijkstra s algorithm is called the single-source shortest path. It is also known as the single source shortest path problem. It computes length of the shortest path from the source to each of the remaining vertices in the graph.
Dijkstra’s algorithm uses the greedy approach to solve the single source shortest problem. It repeatedly selects from the unselected vertices, vertex v nearest to source s and declares the distance to be the actual shortest distance from s to v.Floyd s algorithm is more general than Dijkstra s because it determines the shortest
route between any two nodes in the network. The algorithm represents an n-node
network as a square matrix with n rows and n columns. Entry (i,j) of the matrix gives
the distance dij from node i to node j, which is finite if i is linked directly to j and
infinite otherwise.