Search Results for "graphs"

The Pythonic Data Structures and Algorithms repository by keon is a hands-on collection of implementations of classical data structures and algorithms written in Python. It offers working, often well-commented code for many standard algorithmic problems — from sorting/searching to graph algorithms, dynamic programming, data structures, and more — making it a valuable resource for learning and reference. For students preparing for technical interviews, self-learners brushing up on...

...Technical documentation and tutorials are available under the following link: https://digraph3.readthedocs.io/en/latest/ The tutorials introduce the main objects like digraphs, outranking digraphs and performance tableaux. There is also a tutorial provided on undirected graphs. Some tutorials are problem oriented and show how to compute the winner of an election, how to build a best choice recommendation, or how to linearly rank or rate with multiple incommensurable performance criteria. Other tutorials concern more specifically operational aspects of computing maximal independent sets (MISs) and kernels in graphs and digraphs.

A GUI sorting visualizer desktop application that helps to visualize various sorting algorithms interactively. Visualizer the sorting algorithms like Bubble sort, Insertion sort, Selection sort, Gnome sort, Shaker sort and Odd even sort. Change the bar color and background by customizing. Increase or decrease speed of animation to visualize the sorting process. Download now!

...The repository emphasizes a learn-by-doing approach: you read a prompt, attempt a solution, and verify behavior with tests, often within notebooks or scripts. Problems span arrays, strings, stacks, queues, linked lists, trees, graphs, dynamic programming, and more, mirroring common interview themes. Many challenges include hints and reference solutions so you can compare approaches and learn idiomatic patterns. The structure encourages incremental improvement—start with a brute-force idea, then refine to optimal time and space complexity. It serves both as a self-study path and as a warm-up bank for interview prep or coding katas.

A generic purpose library in Python. It includes directed graphs, dependency graphs, threads-related algorithms, etc.

A simple (~20 line python) O(n^6) algorithm for the traveling salesman problem that seems to do pretty well for most graphs; so well that I have not been able to find a graph which it does optimally solve. Those with spare cycles are welcome to help out.