I am going to introduce a concept through which we can calculate the shortest distance of all the destination vertices form the single source. In this topic, we will see different types of weights (positive and negative) on edges in a graph and there may be chances to get the negative weight edges/cycles in G->(V,E). Then we will see, whether we can find out the shortest path or fall into the infinity loop.
All cases are going to be discussed in this topic with diagrammatic and real approach
All cases are going to be discussed in this topic with diagrammatic and real approach