Thread: Sefmentation Fault

well in #22 i explained my scenario not my code...

but in #19 u can find the entire code

i am refering to this part

Code:

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++;
        }

which is in #19..i took this part and explained the scenario in #22

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
.