Articles related to data structures and algorithms problems, arrays, stack, queue, heap, tree, graph, matrix, and other advanced topics.

Breadth-First Search in Python [Full Code]

Summary: In this tutorial, you will learn to implement the breadth first search (BFS) in Python with the help of an example. What is Breadth-First Search? Breadth-first search (BFS) is…

3 Ways to Implement Queue in Python

Summary: In this tutorial, we will learn three different ways to implement queue data structure in Python. A queue is a collection of elements that maintains a sequence in which…

Difference between char[] and char*

Summary: In this tutorial, we will learn what is the difference between char[] and char* in the C/C++ programming languages. We as programmers often use char[] and char* to store…

Algorithms: Learn how to solve problems using programs.

Why do Shortest Path Algorithms fail in Graphs with Negative Cycle?

The shortest path algorithms such as Dijkstra and Bellman-Ford algorithm don't give the right results when there's a negative cycle in the graph. Dijkstra's AlgorithmBellman-Ford AlgorithmGraph with Negative EdgeFailsPassGraph with…

Algorithms: Learn how to solve problems using programs.

Why doesn’t Dijkstra work with negative weights?

Dijkstra's algorithm is the most popular algorithm to solve single-source shortest path problems. It can find the shortest path from a given source to all other vertices in a given…