well in #22 i explained my scenario not my code...
but in #19 u can find the entire code
i am refering to this partwhich is in #19..i took this part and explained the scenario in #22Code:
// cout<<"\n CITY\n";
well tat is it i have no more code
well maybe to add fursther i can provide u with i/p and bounds
no.of adjacent nodes
adjacent node and its weight -bound
no.of paths to find -bound
source 1 dest 1
i cud not find my bug stil.. i am not sure where am getting seg fault... if i increase maxnodes and maxedges i get some memory prob....
else i get seg fault...its driving me mad
i have posted enuf requirements even my entire code...
but no suggestions on it stil