Home Explore Help
Sign In
cryptarch
/
ganesha
Watch 1
Star 0
Fork 0
Files Issues 0 Pull Requests 0 Wiki

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

Branch: master
Branches Tags
ganesha
ZIP TAR.GZ
Timothy Rice 91b1439006 Fixed incorrect information in Doxyfile (which was copied from another project). 11 years ago
.gitignore 8ae1c8dccf Added files for doing operations. 11 years ago
Doxyfile 91b1439006 Fixed incorrect information in Doxyfile (which was copied from another project). 11 years ago
LICENSE 1a6c552e20 Had MIT license confused with modified BSD. 11 years ago
LICENSE.BSD 1a6c552e20 Had MIT license confused with modified BSD. 11 years ago
LICENSE.GPL 3ad2d6e549 Added README and LICENSE files. 11 years ago
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 years ago
README 3ad2d6e549 Added README and LICENSE files. 11 years ago
args.h bf213877c2 Finished implementing symmetric difference. 11 years ago
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 years ago
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 years ago
input.c 78f7890c1f Initial commit. 11 years ago
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 years ago
main.c 967ca86e9c Put in a few sanity checks. 11 years ago
operations.c bf213877c2 Finished implementing symmetric difference. 11 years ago
operations.h e826f8b959 Function to calculate symmetric difference (xor) of arbitrary number of graphs (UNTESTED). 11 years ago
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 years ago

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 .