Advanced Algorithms and Data Structures FER labs
A Python solution to the Undirected Chinese Postman Problem (Route Inspection) using Dijkstra's, Minimum Weight Perfect Matching, and Hierholzer's algorithm.
C++ Algorithms
This repository have the implementation of a string reconstructor using Bruijn graphs and eulerian path. This problem is very important in bioinformatics, because it is used to reconstruct the DNA sequence from a set of k-mers.
Compute a Eulerian trail (Eulerian path) through a graph iff one exists
A service that reconstructs a valid flight itinerary from a list of airline tickets.
This repository contains my systematic implementation of fundamental graph and digraph algorithms in Java, created while learning graph theory and algorithmic problem-solving.
Chinese Postman Problem (CPP) or Route Inspection Problem Solution in Rust
To associate your repository with the hierholzers-algorithm topic, visit your repo's landing page and select "manage topics."