How to find minimal ring in the graph,(I got AC but it's very slow)
Mine is
 for(from=0;from<n;from++)
  for(to=from+1;to<n;to++)
    {
      delete path(from,to)
      find m=the shortest path(from,to)
      ringpath=m+dis(from,to);
      if( ringpath < minring ) minring=ringpath;
    }

you should use N dijkestra to find it ...
if u cant mail me : SSF_DIGI@hotmail.com i'll help u !!! :p

why? i use pascal and i also use n dijkstra but it's time out???

yes!I use dijkstra for every edge!tle!!!

mine is tle....

but why u use it for edges? u can just use it for every points.

sorry, points->point

I tle on test1,why?????????????????????????????