/*
Cheng-Chun Tu, Feb 7, 2011
*/

#include <stdio.h>
#include <stdlib.h>
#include <igraph/igraph.h>
#include <igraph/error.h>
/*
	http://cneurocvs.rmki.kfki.hu/igraph/doc/html/ch04s02s02.html
*/
int print_igraph(igraph_t *graph) {
	int num_vertices = igraph_vcount(graph);
	int num_edges = igraph_ecount(graph);
	printf("Number of Vertices and Edges: %d %d\n", num_vertices, num_edges);
	printf("Directed %d\n", igraph_is_directed(graph));
	return 0;
}

int print_vector(igraph_vector_t *vector) {
	int i;
	printf("vector: ");
	for (i=0; i<igraph_vector_size(vector); i++)
		printf(" %d", (int)VECTOR(*vector)[i]);
	printf("\n");
	return 0;
}

int write_igraph(char *filename, igraph_t *graph) {
	FILE *file;
	file = fopen(filename, "w+");
	igraph_write_graph_graphml(graph, file);
	return 0;
}

int read_igraph(char *filename, igraph_t *graph) {
	FILE *file;
	file = fopen(filename, "r");
	igraph_read_graph_graphml(graph, file, 0);
	return 0;
}

int update_edge_attr(igraph_t *graph) {
	long int i, value;
	int ecount = (int)igraph_ecount(graph);
	for (i=0; i<igraph_ecount(graph); i++) {
		int index;
		srand(200);
		index = rand() % ecount;
		value = igraph_cattribute_EAN(graph, "cap", index);
		igraph_cattribute_EAN_set(graph, "load", i, value);
	}
}

int test_igraph_full(void) {
	int i;	
	igraph_t graph;
	igraph_vector_t attr_v;
	
	igraph_full(&graph, 10, 0, 0);

	srand(100);
	igraph_vector_init(&attr_v, igraph_ecount(&graph));
	for (i=0; i<igraph_vector_size(&attr_v); i++) {
		VECTOR(attr_v)[i] = rand() % (int)igraph_vcount(&graph);
	}
	/* set initial value of load */
	igraph_cattribute_EAN_setv(&graph, "load", &attr_v);
	igraph_cattribute_EAN_setv(&graph, "cap", &attr_v);

	/* random read write */
	update_edge_attr(&graph);
	print_igraph(&graph);
	
	write_igraph("graph.out", &graph);
	return 0;
}

int main(){           
	igraph_i_set_attribute_table(&igraph_cattribute_table);
	test_igraph_full();
    return 0;
}