cryptarch/ganesha: Program to perform operations on graphs such as edge union and intersection

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

		
				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 .