Pagini recente » Cod sursa (job #2867919) | Cod sursa (job #1039755) | Cod sursa (job #1013883) | Rating darie (duriel) | Cod sursa (job #1251338)
#include <fstream>
#include <vector>
#define NMAX 100001
using namespace std;
ifstream fin ("graf.in");
ofstream fout ("graf.out");
vector <int> gi[NMAX],gt[NMAX],sol[NMAX];
int uz[NMAX], post[NMAX];
int n, m, lg, comp;
void citire();
void dfs(int);
void dfst(int);
int main()
{
int i, j;
citire();
for (i=1; i<=n; ++i)
if (uz[i]==0)
dfs(i);
for(i=1; i<=n; i++)
uz[i]=0;
for(i=n; i>=1; i--)
if(uz[post[i]]==0)
{
comp++;
dfst(post[i]);
}
fout<<comp<<'\n';
for(i=1;i<=comp;i++)
{
for(j=0;j<sol[i].size();j++)
fout<<sol[i][j]<<' ';
fout<<'\n';
}
return 0;
}
void citire()
{
int x,y,i;
fin>>n>>m;
for(i=1; i<=m; i++)
{
fin>>x>>y;
gi[x].push_back(y);
gt[y].push_back(x);
}
}
void dfs(int z)
{
int i;
uz[z]=1;
for (i=0; i<gi[z].size(); i++)
if (uz[gi[z][i]]==0)
dfs(gi[z][i]);
post[++lg]=z;
}
void dfst (int z)
{
int i;
uz[z]=1;
sol[comp].push_back(z);
for (i=0; i<gt[z].size(); i++)
if (uz[gt[z][i]]==0)
dfst(gt[z][i]);
}