Compilers can produce warnings - make the compiler programmers happy: Use them!
Please don't PM me for help - and no, I don't do help over instant messengers.
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:while(altnum_Nodes) { // cout<<"\n CITY\n"; cin>>str2[j]; scanf("%I64d",&altnum_Edges[j]); num_Edges+=altnum_Edges[j]; for(i=0;i<altnum_Edges[j];i++) { v1[k]=j+1; scanf("%I64d",&v2[k]); scanf("%I64d",&alt); elements[v1[k]+v2[k]+v1[k]*v2[k]]=alt; k++; } altnum_Nodes--; j++; }
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 testcases
no.of nodess
node name
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
Last edited by dpp; 01-21-2009 at 09:38 AM.