Heuristic Path Planning is a project dedicated to finding optimal routes efficiently. Applicable across robotics, transportation, and gaming, it offers robust and timely path planning solutions.

The Kernighan–Lin algorithm is a heuristic algorithm for finding partitions of graphs. The algorithm has important applications in the layout of digital circuits and components in VLSI.

Kernighan-Lin Algorithm implementation in python. Kernighan-Lin Algorithm is a graph partitioning algorithm that optimizes the cut size between two subsets of nodes.