Implementations of various algorithms regarding graphs in Java. This was developed for a CSD project in AUTH. Made public for reference. Comments are in Greek, may change them to English eventually.
Algorithms included:
- Algorithms for finding Eulerian Circuits
- Fleury Algorithm
- Hierholtzer Algorithm
- Tucker Algorithm
- Prufer Sequence
- Prufer Encoding
- Prufer Decoding
- Mac Lane's planarity criterion
- Edmonds-Karp max flow algorithm