What is Breadth-First Search? A Gentle Introduction to AI Problem Solving and Shortest Paths

An explanation of what Breadth-First Search is for beginners. We will gently introduce the differences from DFS, how queues ...
SlashGear

A New Algorithm Beats Dijkstra's Time For The Shortest Path To Any Point In A Network

When Edsger W. Dijkstra published his algorithm in 1959, computer networks were barely a thing. The algorithm in question found the shortest path between any two nodes on a graph, with a variant ...
techtarget

Open Shortest Path First (OSPF)

What is Open Shortest Path First (OSPF)? Open Shortest Path First (OSPF) is an IP routing protocol that uses a mathematical algorithm to calculate the most efficient path to direct traffic on IP ...
Wired

A New Algorithm Makes It Faster to Find the Shortest Paths

The original version of this story appeared in Quanta Magazine. If you want to solve a tricky problem, it often helps to get organized. You might, for example, break the problem into pieces and tackle ...
GIGAZINE

Visualizing the algorithm for finding the shortest path "PathFinding.js"

Many people are taking care of the service which instantly finds the shortest route to the destination, such as a car navigation application or a smartphone map application, but most people who know ...