hierholzers-algorithm

Here are 3 public repositories matching this topic...

msmrexe / python-chinese-postman-solver

A Python solution to the Undirected Chinese Postman Problem (Route Inspection) using Dijkstra's, Minimum Weight Perfect Matching, and Hierholzer's algorithm.

python university-project course-project dijkstra-algorithm algorithms-and-data-structures eulerian-circuit weighted-graphs chinese-postman-problem route-inspection-problem hierholzers-algorithm minimum-weight-perfect-matching

Updated Oct 23, 2025
Python

sskender / AADS

Star

Advanced Algorithms and Data Structures FER labs

avl-tree trie binary-search-tree binary-tree balanced-tree huffman-compression-algorithm patricia-tree trie-tree dsw lz77-compression-algorithm skip-list simple-binary-search-tree hierholzers-algorithm

Updated Jan 29, 2023
Python

icarogabryel / string-reconstruction-problem

Star

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.

bioinformatics graph string dna kmer eulerian-path bruijn hierholzers-algorithm

Updated Aug 3, 2024
Python

Improve this page

Add a description, image, and links to the hierholzers-algorithm topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the hierholzers-algorithm topic, visit your repo's landing page and select "manage topics."

Learn more

Provide feedback

Saved searches

Use saved searches to filter your results more quickly