Implement A* Shortest Path using Neo4j
Publish Date: 2022-10-17 9 min read
The A* (pronounced "A-Star") Shortest Path algorithm computes the shortest path between two nodes. A* is an informed search algorithm as it uses a heuristic function to guide the graph traversal. The algorithm supports weighted graphs with positive relationship weights. Today We will learn How to...
Read moreImplement Binary Search Algorithm
Publish Date: 2022-09-25 6 min read
let’s play a game called guess the number. suppose I have a number chosen in my mind between 1 and 100 and you have to find that exact number, and with every guess, I’ll tell you if your guess is too low, too high, or correct. One way you might think of is to start by 1.2.3.. until you find the...
Read moreImplement Selection Sort Algorithm
Publish Date: 2022-09-25 7 min read
suppose you have a list of countries with their surface areas, and you want to sort them based on surface area, in descending order from the largest to smallest: you want to sort this list from largess area to the smallest, how can you do that ? One way is to go through the list and find the...
Read moreHow to use and Implement a Stack ?
Publish Date: 2022-10-04 9 min read
A stack represents a sequence of objects or elements in a linear data structure format and is based on the principle of Last In First Out (LIFO). It is commonly used as an abstract data type with two major operations namely push and pop, which are carried out on the topmost element recently added...
Read moreThe principles of Heuristic Function and GPS coordinates
Publish Date: 2022-10-20 10 min read
In sphere we have no strait lines, so the distance between 2 points on the surface of sphere measured by geodesics which is circles whose centers coincide with the center of the sphere, and they are called great circles. Between antipodal points (directly opposite each other ), there are infinitely...
Read more