1. INTRODUCTION

The aim of this interactive lesson is to explain how BFS, Dijkstra and A* can be seen as the same generalized graph algorithm with different parameters.

The general algorithm explores the graph by adding nodes in a frontier and visiting them in a certain order.

Each time a node is visited, its neighbors are added to the frontier.

The algorithm stops when the frontier is empty.

The algorithm can behave in different ways depending on the Queue used for the frontier.