Pagini recente » Cod sursa (job #16585) | Cod sursa (job #1636380)
#include <iostream>
#include <vector>
#include <stack>
#include <fstream>
using namespace std;
vector<vector<int> > graph;
vector<bool> visited;
stack<int> sorted;
int n, m;
void dfs(int vertex)
{
if(vertex<0||vertex>n-1)
return;
//sorted.push(vertex+1); //sortare alternativa 1
stack<int> s;
int element, i;
bool found;
s.push(vertex);
visited[vertex]=true;
while (!s.empty())
{
element=s.top();
found=false;
for (i=0;i<graph[element].size()&&!found;i++)
if (!visited[graph[element][i]])
found=true;
if (found)
{
i--;
s.push(graph[element][i]);
//sorted.push(graph[element][i]+1); //sortare alternativa 2
visited[graph[element][i]]=true;
}
else
{
sorted.push(s.top()+1);
s.pop();
}
}
}
int main()
{
ifstream in("sortaret.in");
//cout<<"sa se introduca numarul de noduri si cel de muchii ";
in>>n>>m;
graph.resize(n);
visited.resize(n, false);
int x, y;
for (int i=0;i<m;i++)
{
//cout<<"sa se introduca o muchie ";
in>>x>>y;
x--;
y--;
graph[x].push_back(y);
}
in.close();
ofstream of("sortaret.out");
for (int i=0;i<visited.size()&&i<n;i++)
{
if(!visited[i])
dfs(i);
while (!sorted.empty())
{
of<<sorted.top()<<" ";
sorted.pop();
}
}
return 0;
}