Version 0.7.1
Jan De Beule
Email: jdebeule@cage.ugent.be
Homepage: http://homepages.vub.ac.be/~jdbeule/
Luke Elliott
Email: le27@st-andrews.ac.uk
Julius Jonušas
Email: jj252@st-andrews.ac.uk
Homepage: http://www-circa.mcs.st-andrews.ac.uk/~julius
James D. Mitchell
Email: jdm3@st-andrews.ac.uk
Homepage: http://goo.gl/ZtViV6
Markus Pfeiffer
Email: markus.pfeiffer@st-andrews.ac.uk
Homepage: https://www.morphism.de/~markusp
Finn Smith
Email: fls3@st-andrews.ac.uk
Michael Torpey
Email: mct25@st-andrews.ac.uk
Homepage: http://www-circa.mcs.st-andrews.ac.uk/~mct25
Wilf A. Wilson
Email: waw7@st-andrews.ac.uk
Homepage: http://www-circa.mcs.st-andrews.ac.uk/~waw7
The Digraphs package is a GAP package containing methods for graphs, digraphs, and multidigraphs.
© 2014-17 by Jan De Beule, Luke Elliott, Julius Jonušas, James D. Mitchell, Markus Pfeiffer, Finn Smith, Michael Torpey, Wilf A. Wilson.
Digraphs is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 3 of the License, or (at your option) any later version.
We would like to thank Chris Jefferson for his help in including the bliss tool in the package. This package's methods for computing digraph homomorphisms are based on work by Max Neunhöffer, and independently Artur Schäfer.
generated by GAPDoc2HTML