Cod sursa(job #2456697)

Utilizator UnDragosDragos Ioana UnDragos Data 15 septembrie 2019 11:33:23
Problema Sortare topologica Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.94 kb
#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
typedef struct node
{
	int val;
	node* next;
};
int N, M;
node* vecini[50001];
int viz[50001];
void read_data(const char* filename)
{
	FILE* fp = fopen(filename, "r");
	fscanf(fp, "%d%d", &N, &M);
	for (int i = 1; i <= N; i++)
	{
		viz[i] = 0;
		vecini[i] = NULL;
	}
	for (int i = 0; i < M; i++)
	{
		int a, b;
		fscanf(fp, "%d%d", &a, &b);
		node* nou = new node;
		nou->val = b;
		nou->next = vecini[a];
		vecini[a] = nou;
	}
	fclose(fp);
}
void DFS(int nod,FILE* fout)
{
	fprintf(fout,"%d ", nod);
	viz[nod] = 1;
	for (node* p = vecini[nod]; p != NULL; p = p->next)
	{
		if (viz[p->val] == 0)
		{
			DFS(p->val,fout);
		}
	}
}
void topological_sort()
{
	FILE* fout = fopen("sortaret.out", "w");
	for (int i = 1; i <= N; i++)
	{
		if (viz[i] == 0)
		{
			DFS(i,fout);
		}
	}
	fclose(fout);
}
int main()
{
	read_data("sortaret.in");
	topological_sort();
}