A generic C++ implementation of a Maze data structure along with maze solving algorithms using graphs.

Check if there is an Eulerian cycle or path in a graph.

This is a program that solves the “Six Degrees of Kevin Bacon” game. This program parses a dataset into a graph and performs shortest path computations. Given any two actors, the aim is to find a “path” between them, consisting of two actors with whom they have coached.