Skip to main content
Deeplycode
Demo courses
馃嚭馃嚫
English
Translate interface
Translation is unavailable offline.
馃嚭馃嚫
English
馃嚫馃嚘
Arabic
Log in
DSJAVA 路 Public course
Data Structures and Algorithms in Java
14 modules 路 56 questions
Start learning
Choose module
1. ADT Contracts and Complexity
2. Arrays and Dynamic Lists
3. Linked Lists and Pointer Invariants
4. Stacks and Expression Processing
5. Queues and Fair Scheduling
6. Call Stacks and Recursion
7. Binary Trees and Traversals
8. Binary Search Trees
9. Heaps and Priority Queues
10. Searching Ordered and Unordered Data
11. Hash Tables and Collision Reasoning
12. Sorting and Divide-and-Conquer
13. Graph Representations and Traversal
14. Shortest Paths and Relaxation
DS-14 路 Module 14 of 14
Shortest Paths and Relaxation
Build path algorithms from relaxation through BFS, Dijkstra, and Bellman-Ford.
Available now
4 questions
Browser-only practice
1
Edge Relaxation Trace
Level 1 路 data-structures 路 java 路 trace
Not started
2
Unweighted Shortest Hops
Level 1 路 data-structures 路 java 路 implement
Not started
3
Dijkstra Distance
Level 3 路 data-structures 路 java 路 apply
Not started
4
Bellman-Ford Distance
Level 3 路 data-structures 路 java 路 challenge
Not started
