How juancardona05/data-structures-python works
This repository is a collection of independent Python exercises, not a single integrated application. Its most complete user-facing workflow is a Tkinter store-inventory demo: a user enters a product code and quantity, the app looks up stock in a binary search tree, then records an order and reduces stock. Other files independently demonstrate shortest-path algorithms, graph structures, expression-tree evaluation, and a Fibonacci-based binary tree. Edges below reflect only visible calls; unsampled files and directories are not inferred.
Main entry points: ejemplo.py Order and stock · MDiscretas.py Expression evaluator
Components 11
Store inventory
- Inventory UI
ejemplo.py - Order and stock
ejemplo.py - Product tree
ejemplo.py
Shortest paths
- Dijkstra distances
dijkstra.py - Bellman-Ford demo
dijkstra.py
Graph structures
- Directed graph
Grafo.py - Heap exercise
heapqfuntion.py
Tree exercises
- Expression builder
MDiscretas.py - Expression evaluator
MDiscretas.py - Fibonacci tree
MDiscretas.py
Other components
- Shopper
Connections 5
- Shopper → Inventory UI: enters order
ejemplo.py - Inventory UI → Order and stock: submits order
ejemplo.py - Order and stock → Product tree: looks up stock
ejemplo.py - Order and stock → Product tree: reduces stock
ejemplo.py - Expression evaluator → Expression builder: evaluates tree
MDiscretas.py