sandesh247/problems — Issue #2: Number of shortest paths between two given nodes
Author: sandesh247
Created: 2011-10-19 05:36:01+00:00
State: open
Labels: algorithm, graph

Given a graph with edge weights, such that every cycle in the graph has a strictly positive weight, design an algorithm to compute the number of shortest paths between two given nodes _u_ and _v_ of the graph.