Explanation: shortest path in ospf is usually computed by dijkstra’s algorithm. it was proposed by edsger w. dijkstra in the year 1956. it is a greedy method algorithm and hence may not guarantee the shortest path every time, but is really fast.