How to Build a Route Planning Application with Breadth First Search and Dijkstra's Algorithm
Introduction
One of the most common applications of graph traversal algorithms is route planning and optimization problems. These can vary from simple things like finding the shortest path from a starting point to a destination to more complex scenar...
memgraph.hashnode.dev9 min read