@tomaszjarosz/react-visualizers 0.4.13 → 0.4.15
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +6 -3
- package/dist/index.cjs +4021 -3094
- package/dist/index.cjs.map +1 -1
- package/dist/index.d.ts +14 -0
- package/dist/index.js +4021 -3094
- package/dist/index.js.map +1 -1
- package/dist/react-visualizers.css +16 -0
- package/package.json +1 -1
package/README.md
CHANGED
|
@@ -8,7 +8,7 @@ Interactive algorithm and data structure visualizers for React. Perfect for lear
|
|
|
8
8
|
|
|
9
9
|
## Features
|
|
10
10
|
|
|
11
|
-
- **
|
|
11
|
+
- **54 interactive visualizers** covering algorithms, data structures, and distributed systems
|
|
12
12
|
- **Interview Mode** with built-in questions, scoring, hints, and explanations
|
|
13
13
|
- **Step-by-step animations** with playback controls (play, pause, step forward/back)
|
|
14
14
|
- **Code highlighting** showing the current line being executed
|
|
@@ -68,7 +68,7 @@ function App() {
|
|
|
68
68
|
| `AStarVisualizer` | A* pathfinding with f(n) = g(n) + h(n) |
|
|
69
69
|
| `TopologicalSortVisualizer` | Kahn's algorithm for DAG ordering |
|
|
70
70
|
|
|
71
|
-
### Data Structures (
|
|
71
|
+
### Data Structures (13)
|
|
72
72
|
|
|
73
73
|
| Visualizer | Description |
|
|
74
74
|
|------------|-------------|
|
|
@@ -78,6 +78,7 @@ function App() {
|
|
|
78
78
|
| `HashTableVisualizer` | Hash function internals and collisions |
|
|
79
79
|
| `ArrayDequeVisualizer` | Circular buffer double-ended queue |
|
|
80
80
|
| `PriorityQueueVisualizer` | Binary min-heap operations |
|
|
81
|
+
| `HeapVisualizer` | Max-heap with build heap and HeapSort |
|
|
81
82
|
| `TreeSetVisualizer` | Red-Black tree (balanced BST) |
|
|
82
83
|
| `LinkedHashMapVisualizer` | HashMap + insertion order linked list |
|
|
83
84
|
| `EnumSetVisualizer` | Bit vector implementation |
|
|
@@ -118,7 +119,7 @@ function App() {
|
|
|
118
119
|
| `GCVisualizer` | JVM generational garbage collection |
|
|
119
120
|
| `SQLJoinVisualizer` | SQL JOIN operations (INNER, LEFT, RIGHT, FULL) |
|
|
120
121
|
|
|
121
|
-
### Interview Mode (
|
|
122
|
+
### Interview Mode (17)
|
|
122
123
|
|
|
123
124
|
Interview visualizers include built-in questions with multiple choice answers, hints, and detailed explanations. Perfect for interview preparation.
|
|
124
125
|
|
|
@@ -139,6 +140,8 @@ Interview visualizers include built-in questions with multiple choice answers, h
|
|
|
139
140
|
| `AStarInterviewVisualizer` | f=g+h, admissible heuristics, Manhattan distance |
|
|
140
141
|
| `SkipListInterviewVisualizer` | Probabilistic levels, expected complexity, Redis |
|
|
141
142
|
| `LinkedListInterviewVisualizer` | Two-pointer techniques, cycle detection, reversal |
|
|
143
|
+
| `HeapInterviewVisualizer` | Heap property, HeapSort, time complexity, priority queues |
|
|
144
|
+
| `SegmentTreeInterviewVisualizer` | Range queries, point updates, lazy propagation, space complexity |
|
|
142
145
|
|
|
143
146
|
## Interview Mode Usage
|
|
144
147
|
|