If a graph has a negative cycle then it's impossible to find a shortest path as every round of the cycle makes the path shorter!
r/>
This clip is from the chapter "Shortest Path Algorithms" of the series "From 0 to 1: Data...

Let’s understand characteristics which can be used to determine which sorting algorithm is the right one for a system.
r/>
This clip is from the chapter "Sorting and Searching" of the series "From 0 to 1: Data Structures &...

Matching parenthesis to check for well-formed expressions helps us solve this using the stack we're already implemented.
r/>
This clip is from the chapter "Stacks And Queues" of the series "From 0 to 1: Data Structures &...

Learn how to traverse and linked lists, add elements to a list and count the number of elements in a list.
r/>
This clip is from the chapter "Linked Lists" of the series "From 0 to 1: Data Structures & Algorithms in Java".In...

Linked lists are less interesting in Java then in other programming languages such as C and C++ which require the developer to manage memory. Learn more about it.
r/>
This clip is from the chapter "Linked Lists" of the series...

Dijkstra's algorithm is a greedy algorithm to find the shortest path in a weighted graph.
r/>
This clip is from the chapter "Shortest Path Algorithms" of the series "From 0 to 1: Data Structures & Algorithms in Java".In this...

This clip is from the chapter "What this course is about" of the series "From 0 to 1: Data Structures & Algorithms in Java".The author introduces herself and the course in this section of the course.

Shell sort builds on top of insertion sort, it improves the complexity of the running time by partitioning the list in a clever way.
r/>
This clip is from the chapter "Sorting and Searching" of the series "From 0 to 1: Data...

Bubble sort has an adaptive sort with the same time complexity as selection sort.
r/>
This clip is from the chapter "Sorting and Searching" of the series "From 0 to 1: Data Structures & Algorithms in Java".Learn about various...

Find the shortest path in a weighted graph where the number of edges also determine which path is shorter.<br/<br/>>

This clip is from the chapter "Graph Problems" of the series "From 0 to 1: Data Structures & Algorithms in Java".null

Let's see how we implement Prim's algorithm in Java.
r/>
This clip is from the chapter "Spanning Tree Algorithms" of the series "From 0 to 1: Data Structures & Algorithms in Java".Prim's algorithm is very similar to Dijkstra's...

Learn to implement the Bellman Ford Algorithm.
r/>
This clip is from the chapter "Shortest Path Algorithms" of the series "From 0 to 1: Data Structures & Algorithms in Java".In this section, we are introduced to unweighted...

Let's see how to implement the circular queue.
r/>
This clip is from the chapter "Stacks And Queues" of the series "From 0 to 1: Data Structures & Algorithms in Java".In this section, we build stack function in Java, meet...

Given a course list and pre-reqs for every course design a course schedule so pre-reqs are done before the courses.
r/>
This clip is from the chapter "Graph Problems" of the series "From 0 to 1: Data Structures & Algorithms in...

The implementation of Dijkstra's algorithm in Java.
r/>
This clip is from the chapter "Shortest Path Algorithms" of the series "From 0 to 1: Data Structures & Algorithms in Java".In this section, we are introduced to unweighted...

Graphs whose edges have a weight associated are widely used to model real world problems (traffic, length of path etc).
r/>
This clip is from the chapter "Shortest Path Algorithms" of the series "From 0 to 1: Data Structures &...

Shortest path implementation in Java.
r/>
This clip is from the chapter "Shortest Path Algorithms" of the series "From 0 to 1: Data Structures & Algorithms in Java".In this section, we are introduced to unweighted graph. We...

Here is the code in Java to implement topological sort.
r/>
This clip is from the chapter "Graph Algorithms" of the series "From 0 to 1: Data Structures & Algorithms in Java".Topological sort is an ordering of vertices in a...

Learn about adjacency list and the adjacency set which are alternate ways to represent a graph.
r/>
This clip is from the chapter "Graphs" of the series "From 0 to 1: Data Structures & Algorithms in Java".The author introduces...

The graph vertices are rows and columns of the matrix and the cell value shows the relationship between the vertices of a graph.
r/>
This clip is from the chapter "Graphs" of the series "From 0 to 1: Data Structures &...

Phase II actually outputs the final sorted array. It involves removing the elements from the heap and placing it in a sorted array.
r/>
This clip is from the chapter "Revisiting Sorting - The Heap Sort" of the series "From 0 to...

Learn to add and remove elements from a heap.
r/>
This clip is from the chapter "Heaps" of the series "From 0 to 1: Data Structures & Algorithms in Java".In this section, we learn about Heap data structure, build a real heap in...

The Binary Heap is logically a Binary Tree with specific constraints. The heap property and the shape property determine whether a Binary Tree is really a Heap.
r/>
This clip is from the chapter "Heaps" of the series "From 0 to...

Learn more about common operations on a Priority Queue are insertion, accessing the highest priority element and removing the highest priority element.
r/>
This clip is from the chapter "Heaps" of the series "From 0 to 1: Data...