در خواست برنامه(ضروری مهم)

gereftane Matrisi shamele raashaaye yek graph va peyda check kardane inke aya rahi beyne raashaye ann vojood darad ya na kare sadeist albate.amma rasme in graph ba tavabe'e graphici c++ khahad bood.
barayae ettelaate bishtar DSF va BSF ro bebinid :
[ برای مشاهده لینک ، با نام کاربری خود وارد شوید یا ثبت نام کنید ] structures and Program Design in C++.pdf

albate code zir ham mitune komaketoon kone:
// m matrise mojaaverate yek graph (VertexNum=tedaade ra~s haa) ast,
// toole kootah tarin masir az rase n1 be n2, va -1 agar masir vojood nadaarad
// PassedVertexes is initially all zero, used inside the function to show
// the vertexes which are passed in the path
const VertexNum=3;
int PassedVertexes[]={0,0,0};
int ShortestPathLen(int m[][VertexNum],int n1,int n2)
{
int i,MinPathLen,l;
if(n1==n2)
return(0);
PassedVertexes[n1]=1; // passing the node n1 and try going to other nodes
MinPathLen=VertexNum; // longest possible path len is VertexNum-1
for(i=0;i<VertexNum;i++)
if(!PassedVertexes[i]&&m[n1][i])
{
l=ShortestPathLen(m,i,n2);
if(l>=0&&l<MinPathLen)
MinPathLen=l;
}
PassedVertexes[n1]=0; // back tracking in the path
if(MinPathLen==VertexNum)
return(-1);
else
return(1+MinPathLen);
}