How klanes09/daa works
This repository is a collection of Java data-structure and algorithm exercises, with interactive console demos and a midterm runner that attempts timed runs across ten structures. The sampled demos read choices or values from the console and print operations or results. The runner directly invokes each structure’s run method, though the sampled implementations of those methods are mostly placeholders. No README content was provided; the tree identifies additional algorithm exercises whose behavior was not sampled.
Main entry points: Analysis.java Structure runner · BinaryT.java Binary tree · Graphs.java Graphs · Max.java Max heap
Components 17
Data Structures
- Binary tree
Prelim/PT1/Binary Trees/BinaryT.java - Graphs
Prelim/PT1/Graphs/Graphs.java - Max heap
Prelim/PT1/Heap/Max.java - Min heap
Prelim/PT1/Heap/Min.java - Linked lists
Prelim/PT1/LinkedList - Circular list
Prelim/PT1/LinkedList/LinCircular.java - Doubly list
Prelim/PT1/LinkedList/LinDoubly.java - Singly list
Prelim/PT1/LinkedList/LinSingly.java - Queues
Prelim/PT1/Queues/Que.java - Priority queue
Prelim/PT1/Queues/PrioQue.java - Stacks
Prelim/PT1/Stacks/STKS.java
Algorithms
- Backtracking
Prelim/PT2/Backtracking.java - Divide and conquer
Prelim/PT2/DaC.java - Fibonacci
Prelim/PT2/Fibonocci.java - Greedy algorithms
Prelim/PT2/Greedy.java
Analysis Runner
- Structure runner
Midterm/Analysis.java
Other components
- Console user
Connections 22
- Console user → Binary tree: enters values
- Console user → Graphs: enters edges
- Console user → Max heap: chooses operations
- Console user → Min heap: chooses operations
- Console user → Circular list: chooses operations
- Console user → Doubly list: chooses operations
- Console user → Queues: chooses operations
- Console user → Priority queue: chooses operations
- Console user → Stacks: chooses operations
- Console user → Divide and conquer: enters array
- Console user → Greedy algorithms: runs example
- Console user → Structure runner: starts run
- Structure runner → Binary tree: invokes runBinaryT
- Structure runner → Graphs: invokes runGraphs
- Structure runner → Max heap: invokes runMax
- Structure runner → Min heap: invokes runMin
- Structure runner → Circular list: invokes runCircular
- Structure runner → Doubly list: invokes runDoubly
- Structure runner → Singly list: invokes runSingly
- Structure runner → Priority queue: invokes runPriorityQue
- Structure runner → Queues: invokes runQueue
- Structure runner → Stacks: invokes runSTKS