else
edge[ i ][ j ] = INF ;
for( i = 1 ; i <= n ; i++)
{
int num ;
scanf( "%s%s%d" , begin ,end ,&num) ;
//cin >> begin >> end >> num ;
if( !MAP[ begin ] )
{
temp++ ;
MAP[ begin ] = temp ;
if( !MAP[ end ] )
{
temp++ ;
MAP[ end ] = temp ;
}
edge[ MAP[ begin ] ][ MAP[ end ] ] = edge[ MAP[ end ] ][ MAP[ begin ] ] = num ;
}
Dijkstra( MAP[ start ] , MAP[ destination ] , MAP.size() ) ;
}
return 0 ;
}