A quick and practical guide to finding the shortest path in a graph visiting all nodes.
Also find me here:
Baeldung Author
Said Sryheni
I am a backend JEE developer specialized in technologies like Spring and Hibernate with +3 years of experience. I have been an ICPC competitive programmer using C++ for +5 years. You can check my ICPCID on https://icpc.baylor.edu/ICPCID/VHOFJ5IO88M4
Here's what I've written (so far):
Obtaining the Path in the Uniform Cost Search Algorithm
Filed under Graph Traversal, Graphs, Path Finding
A quick and practical overview of Uniform Cost Search pathfinding algorithm.
How to Merge Sort A Linked List
Filed under Data Structures
A quick and introduction to merge sorting a linked list.
Find Local Minimum in N x N Matrix
Filed under Algorithms, Math and Logic
Learn how to solve the problem of finding the local minimum in an N x N matrix
Flood Fill Algorithm
Filed under Algorithms
A quick and practical overview of the Flood Fill algorithm.
Number of Shortest Paths in a Graph
Filed under Path Finding
A quick and practical guide to finding the number of shortest paths in a graph.
Counting Inversions in an Array
Filed under Algorithms
Understand what an inversion is and look into ways of solving the problem of counting inversions in an array.
Finding a Cycle in a Singly Linked-List
Filed under Algorithms, Path Finding
Have a look at algorithms for finding a cycle in a singly linked-list.
Finding the Most Significant Bit
Filed under Algorithms, Core Concepts
A quick and practical guide to finding the most significant bit.
Non-Recursive Merge Sort
Filed under Sorting
A quick and practical overview of the non-recursive merge sort algorithm.