Program to perform operations on graphs such as edge union and intersection

Timothy Rice 91b1439006 Fixed incorrect information in Doxyfile (which was copied from another project). 11 роки тому
.gitignore 8ae1c8dccf Added files for doing operations. 11 роки тому
Doxyfile 91b1439006 Fixed incorrect information in Doxyfile (which was copied from another project). 11 роки тому
LICENSE 1a6c552e20 Had MIT license confused with modified BSD. 11 роки тому
LICENSE.BSD 1a6c552e20 Had MIT license confused with modified BSD. 11 роки тому
LICENSE.GPL 3ad2d6e549 Added README and LICENSE files. 11 роки тому
Makefile 6e6f11e6cb Put graphs inside a struct so we can track whether they've been initialised. Then put in appropriate tests for initialisation before using igraph functions that assume either initialised or uninitialised graphs. 11 роки тому
README 3ad2d6e549 Added README and LICENSE files. 11 роки тому
args.h bf213877c2 Finished implementing symmetric difference. 11 роки тому
graph.c 6e6f11e6cb Put graphs inside a struct so we can track whether they've been initialised. Then put in appropriate tests for initialisation before using igraph functions that assume either initialised or uninitialised graphs. 11 роки тому
graph.h 6e6f11e6cb Put graphs inside a struct so we can track whether they've been initialised. Then put in appropriate tests for initialisation before using igraph functions that assume either initialised or uninitialised graphs. 11 роки тому
input.c 78f7890c1f Initial commit. 11 роки тому
io.h 6e6f11e6cb Put graphs inside a struct so we can track whether they've been initialised. Then put in appropriate tests for initialisation before using igraph functions that assume either initialised or uninitialised graphs. 11 роки тому
main.c 967ca86e9c Put in a few sanity checks. 11 роки тому
operations.c bf213877c2 Finished implementing symmetric difference. 11 роки тому
operations.h e826f8b959 Function to calculate symmetric difference (xor) of arbitrary number of graphs (UNTESTED). 11 роки тому
output.c 6e6f11e6cb Put graphs inside a struct so we can track whether they've been initialised. Then put in appropriate tests for initialisation before using igraph functions that assume either initialised or uninitialised graphs. 11 роки тому

README

Usage: ganesha [OPTION...] FILE1 FILE2 ... FILEN
Ganesha -- perform operations on graphs.

-f, --output_format=FORMAT Select output format from dot (default), graphml,
gml, pajek, edgelist, ncol, lgl, dimacs.
-i, --input_format=FORMAT Select input format from graphml, gml, pajek,
edgelist, ncol, lgl, dimacs, graphdb, dl.
(Required.)
-o, --output=OUTFILE Output to OUTFILE instead of to standard output
-w, --operation=OPERATION Select OPERATION from union, intersection.
(Required.)
-?, --help Give this help list
--usage Give a short usage message
-V, --version Print program version

Mandatory or optional arguments to long options are also mandatory or optional
for any corresponding short options.

Report bugs to .