How mxbrk/dsa-templates works
This repository is a set of standalone Python data-structure and algorithm examples, not a single application: there is no README-defined end-to-end workflow or shared runtime entry point. A user or caller selects a module and uses its class or functions; several files also run small demonstrations at import time. The graph shows those independent capabilities without implying they call one another. Relationships are limited to caller-to-module use because the sampled source shows no cross-module calls.
Main entry points: BinarySearchTree.py Search tree · DoubleLinkedList.py Doubly linked list · LinkedList.py Linked list · Heaps.py Min/max heaps
Components 12
Data structures
- Search tree
BinarySearchTree.py - Doubly linked list
DoubleLinkedList.py - Linked list
LinkedList.py - Min/max heaps
Heaps.py - Hash table
HashTable.py - Undirected graph
Graphs.py - Queue
Queue.py - Stack
Stack.py
Algorithms
- Basic sorts
Sort.py - Merge sort
Merge.py - Factorial
factorial.py
Other components
- Caller
Connections 11
- Caller → Search tree: uses
- Caller → Doubly linked list: uses
- Caller → Linked list: uses
- Caller → Min/max heaps: uses
- Caller → Hash table: uses
- Caller → Undirected graph: uses
- Caller → Queue: uses
- Caller → Stack: uses
- Caller → Basic sorts: uses
- Caller → Merge sort: uses
- Caller → Factorial: runs