C ++ program to find the minimum numbers of moves needed to move from source to destination .
#include <bits/stdc++.h> NEW_LINE using namespace std ; #define N  4 NEW_LINE class Graph { int V ; list < int > * adj ; public : Graph ( int V ) { this -> V = V ; adj = new list < int > [ V ] ; } void addEdge ( int s , int d ) ; int BFS ( int s , int d ) ; } ;