title: Modified shortest path using Dijkstra's or Bellman–Ford's algorithm
body: <p>How can we use Dijkstra's or Bellman–Ford's algorithm to find shortest path in a graph whose some of edges are affected if we go specific vertices. Such that, the affected edge's length will be more than or less than the original length.</p>