Pinned Repositories
EulerTour
DFS based technique for finding the eulerian circuit tour of the given graph.
TravellingSalesMan
Dynamic programming approach to solve Travelling Sales Man problem
BackTracking
SodokuSolver
ClosestPair
A program that shows comparision between O( n logn) divide and conquer vs O (n ^ 2) brute force solution for finding the closest pair of points from a given set of points.
fpinscala
Code, exercises, answers, and hints to go along with the book "Functional Programming in Scala"
googlecharts
Ruby Google Chart API
Parallel-TSP
Heuristic based TSP that utilizes multiple cores present in the machine
sodoku
test
prupakheti's Repositories
prupakheti/fpinscala
Code, exercises, answers, and hints to go along with the book "Functional Programming in Scala"
prupakheti/test
prupakheti/googlecharts
Ruby Google Chart API
prupakheti/Parallel-TSP
Heuristic based TSP that utilizes multiple cores present in the machine
prupakheti/ClosestPair
A program that shows comparision between O( n logn) divide and conquer vs O (n ^ 2) brute force solution for finding the closest pair of points from a given set of points.
prupakheti/EulerTour
DFS based technique for finding the eulerian circuit tour of the given graph.
prupakheti/TravellingSalesMan
Dynamic programming approach to solve Travelling Sales Man problem
prupakheti/sodoku
prupakheti/BackTracking
SodokuSolver