Compute a Eulerian trail (Eulerian path) through a graph iff one exists
-
Updated
May 28, 2020 - C
Compute a Eulerian trail (Eulerian path) through a graph iff one exists
3rd sem Discrete Mathematics and Logic assignment on graphs. C Functions to answer the following questions:
It detects either the Graph is a Eulerian Path or a Cycle
Z- algorithm for pattern matching, Trie-Aho-Corasick Automaton(FGREP), Hungarian Algorithm for the Munkres Assignment Problem, Binary Lifting, Eulerian Tour for Least Common Ancestor(LCA) using Sparse Table coupled with Farach-Colton and Bender optimization, Wellsh Powell Algorithm for Graph Coloring, Kahn's Agorithm for TopSort and Cycle detect…
Add a description, image, and links to the eulerian-path topic page so that developers can more easily learn about it.
To associate your repository with the eulerian-path topic, visit your repo's landing page and select "manage topics."