/Graph-Search-Algorithms

Graph search methods include blind search methods such as depth-first search (DFS), breadth-first search (BFS) or Dijkstra's algorithm and informed search methods such as hill climbing, beam search, Best-first or A* and contraction hierarchies.

Primary LanguageJupyter NotebookMIT LicenseMIT

Graph-Search-Algorithms

Graph search methods include blind search methods such as depth-first search (DFS), breadth-first search (DFS) or Dijkstra's algorithm and informed search methods such as hill climbing, beam search, Best-first or A* and contraction hierarchies. Point to points queries are given as examples.

Algorithm Notebooks

  • Open In Colab Breadth First Search

  • Open In Colab Depth First Search

  • Open In Colab Dijkstra

  • Hill Climbing

  • Beam Search

  • Open In Colab A*

  • Open In Colab Bi-Directional Search (MM)

  • Open In Colab Contraction Hierarchies (CHs)

  • Multi-Level Dijkstra (MLD)

Toy Problems Notebook

  • Open In Colab Travelling Salesman Problem

  • Open In Colab Minimum Spanning Tree

  • Open In Colab Grid-based Motion Planning

Case Study Notebook

  • Open In Colab GIS Routing