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

#include "MatrixGraph.h"

/**
 * Initializeaza graful cu numarul de noduri primit ca parametru si aloca
 * memorie pentru matricea de adiacenta a grafului.
*/
void init_matrix_graph(MatrixGraph *graph, int nodes) {
    /* TODO */
    graph->nodes = nodes;
    graph->matrix = (int **)calloc(nodes, sizeof(int *));
    if (graph->matrix == NULL) {
    	fprintf(stderr, "Matrix not initialised.\n");
    	return;
    }
    for (int i=0; i < nodes; ++i) {
    	graph->matrix[i]=(int *) calloc (nodes, sizeof(int));
    	if (graph->matrix[i] == NULL) {
    		fprintf(stderr, "Matrix not initialised.\n");
    		return;
    	}
    }
}

/* Adauga o muchie intre nodurile sursa si destinatie */
void add_edge_matrix_graph(MatrixGraph *graph, int src, int dest) {
    /* TODO */
    graph->matrix[src][dest] = 1;
    graph->matrix[dest][src] = 1;
}

/* Returneaza 1 daca exista muchie intre cele doua noduri, 0 in caz contrar */
int has_edge_matrix_graph(MatrixGraph *graph, int src, int dest) {
    /* TODO */
    if(graph->matrix[src][dest] == 1 && graph->matrix[dest][src] == 1) {
        return 1;
    }

    return 0;
}

/* Elimina muchia dintre nodurile sursa si destinatie */
void remove_edge_matrix_graph(MatrixGraph *graph, int src, int dest) {
    /* TODO */
    graph->matrix[src][dest] = 0;
    graph->matrix[dest][src] = 0;
}

/* Elibereaza memoria folosita de matricea de adiacenta a grafului */
void clear_matrix_graph(MatrixGraph *graph) {
    /* TODO */
    for (int i=0; i < graph->nodes; ++i) {
    	free(graph->matrix[i]);
    }
    free(graph->matrix);
}