Closest Pair of Points Algorithm Python Implementation – Animated

This is Python implementation of the Closest Pair of Points algorithm. It uses pyplot from matplotlib Python library to show points on a graph and animate them.

This algorithm runs in O(nlogn) time.

The algorithm divides the array of points in the middle and recursively solves left and right side. If number of points is less than 3, it uses brute-force technique.

You can find the full source code at : Closest Pair of Points

Closest Pair of Points Python Implementation by Gokhan Arik

Closest Pair of Points Python Implementation by Gokhan Arik

Closest Pair of Points Python Implementation by Gokhan Arik

Closest Pair of Points Python Implementation by Gokhan Arik

Closest Pair of Points Python Implementation by Gokhan Arik

Closest Pair of Points Python Implementation by Gokhan Arik

Python Implementation of Depth First Search – Animated Traversal

Depth First Search (DFS) is one of the most important algorithms in computer science. This is Pyhton implementation of the algorithm with step by step animated traversal using networkx Pyhton library. 

You can find the full source code at : Depth First Search

P.S. I will post detailed explanation of code later.

Depth First Search by Gokhan Arik

Depth First Search by Gokhan Arik

Depth First Search by Gokhan Arik

Depth First Search by Gokhan Arik