C # implementation to find the shortest path in a directed graph from source vertex to the destination vertex
using System ; using System . Collections ; using System . Collections . Generic ; class Pair { public int first , second ; public Pair ( int first , int second ) { this . first = first ; this . second = second ; } } class GFG { static int infi = 1000000000 ;