Search found 2 matches: {{ssc.p.num}}

Searched query: ssc p num

ignored: num p

by asif_iut
Thu Nov 11, 2010 7:56 am
Forum: Volume 118 (11800-11899)
Topic: 11838 - Come and Go
Replies: 22
Views: 6854

Re: 11838 - Come And Go

#include<iostream> #include<algorithm> #include<cmath> #include<string> #include<cstring> #include<cctype> #include<set> #include<queue> #include<stack> #include<list> #include<map> #include<sstream> #include<vector> using namespace std; typedef vector<int> vi; typedef vector< vi > vii; typedef map...
by kwedeer
Wed Jun 18, 2008 12:26 am
Forum: Algorithms
Topic: Minimum set of nodes through which the eah path goes
Replies: 9
Views: 2277

Re: Minimum set of nodes through which the eah path goes

OK - I started to implement the solution and my plan was - to find the strongly connected components SSC for the first instances. There is nice algorithm in Kormen for this: 1) one should make DFS for initial graph G and determin how the vortices are ordered according to time - say in some array f; ...

Go to advanced search