#include "header.h"

#include <stdlib.h>
#include <string.h>
#include <stdio.h>

void loadfrom(){
	int i,j;
	FILE *file;
	countofver = 0;
	step = 0;
	buf_b = 0;
	buf_e = 0;
	countrow = 0;
	file = fopen("graph.txt", "r");
	if (file == NULL){
		printf("Cannot open this file \n");
		exit(0);
	}
	else{
		//смотрим кол-во строк| кол-во строк = кол-во вершин
		char s[1024];
		fseek(file, 0, SEEK_SET);
		while (!feof(file)){
			fgets(s, 1024, file);
			if (parse_string(s)) {
				if (buf_b + 1 > countofver)
					countofver = buf_b + 1;
				if (buf_e + 1 > countofver)
					countofver = buf_e + 1;
			}
		}
		result = (int*)malloc(countofver* (sizeof(int)));
		visited = (int*)malloc(countofver * sizeof(int));
		graph = (int **)malloc(countofver * sizeof(int *));
		for (i = 0; i < countofver; i++)
			graph[i] = (int *)malloc(countofver * sizeof(int));
		fseek(file, 0, SEEK_SET);
		for (i = 0; i < countofver; i++){
			for (j = 0; j < countofver; j++){
				graph[i][j] = 0;
			}
		}
		while (!feof(file)){
			fgets(s, 1024, file);
			if (parse_string(s)) {
				graph[buf_b][buf_e] = 1;
			}
		}
		for (i = 0; i < countofver; i++){
			for (j = 0; j < countofver; j++){
				printf("%d ", graph[i][j]);
			}
			printf("\n");
		}
		fclose(file);
	}
}

void mainalgo(){
	int i,j;
	for ( i = 0; i < countofver; i++)
		visited[i] = 0;
	for ( i = 0; i < countofver; i++){
		if (!visited[i]){
			deepfind(i);
		}
	}
	//переворачиваем массив
	for ( i = 0, j = countofver - 1; i < j; i++, j--){
		int tmp = result[i];
		result[i] = result[j];
		result[j] = tmp;
	}
	for ( i = 0; i < countofver; i++)
		printf("%d  ", result[i]);
}

void deepfind(int ver){
	int i;
	visited[ver] = 1;
	for (i = 0; i < countofver; i++){
		if (graph[ver][i] && !visited[i]){
			deepfind(i);
		}
	}
	result[step] = ver;
	step++;
}

void saveto(){
	FILE *file = fopen("graphviz.txt", "w+");
	int i,j;
	int **buff;
	//пересобираем матрицу :
	printf("\n");
	buff = (int **)malloc(countofver * sizeof(int *));
	for (i = 0; i < countofver; i++)
		buff[i] = (int *)malloc(countofver * sizeof(int));

	for ( i = 0; i < countofver; i++){
		for ( j = 0; j < countofver; j++){
			buff[result[i]][j] = graph[i][j];
			graph[i][j] = buff[result[i]][j];
		}
	}

	for ( i = 0; i < countofver; i++){
		for ( j = 0; j < countofver; j++){
			graph[j][result[i]] = buff[j][i];
		}
	}

	fprintf(file, "digraph {\n");
	for ( i = 0; i < countofver; i++){
		for ( j = 0; j < countofver; j++){
			if (graph[i][j])
				fprintf(file, "  %d -> %d;\n", i + 1, j + 1);
		}
	}
	fprintf(file, "}");
	free(visited);
	free(graph);
	free(result);
}

int parse_string(char *s) {
	int j,i,snd_begin;
	char *buffer;
	i=0;
	while (s[i] >= '0' && s[i] <= '9')
		++i;
	if (i == 0 || s[i] == '\0')
		return 0;
	buffer = (char*)malloc(i + 1);
	for (j = 0; j < i; j++)
		buffer[j] = s[j];
	buffer[i] = '\0';
	buf_b = atoi(buffer);
	free(buffer);

	while ((s[i] < '0' || s[i] > '9') && s[i] != '\0')
		++i;
	if (s[i] == '\0')
		return 0;
	snd_begin = i;
	while (s[i] >= '0' && s[i] <= '9')
		++i;
	if (s[i] == '\0')
		return 0;
	buffer = (char*)malloc(i - snd_begin + 1);
	for (j = snd_begin; j < i; j++)
		buffer[j - snd_begin] = s[j];
	buffer[i - snd_begin] = '\0';
	buf_e = atoi(buffer);
	free(buffer);
	return 1;
}