Description  Go language implementation of selected algorithms from the "Algorithms in a Nutshell" book. The source code attempts to follow, as closely as possible, the algorithm pseudocode from the book. Building/Installing/Testing  $ make [allcleaninstalltestbuild] all : calls clean, install, and test build : compiles but doesn't install Usage  Examples  Status Completed  Sorting Algorithms: [X] Insertion Sort [X] Median Sort [X] Quick Sort [X] Selection Sort [X] Heap Sort [X] Counting Sort [X] Bucket Sort [X] Searching: [] Sequential Search [X] Binary Search [X] Hashbased Search [] Binary Tree Search [] Graph Algorithms: [] DepthFirst Search [] BreadthFirst Search [] SingleSource Shortest Path [] All Pairs Shortest Path [] Minimum Spanning Tree Algorithms [] Path Finding in AI: [] DepthFirst Search [] BreadthFirst Search [] A*Search [] Comparison [] Minimax [] NegMax [] AlphaBeta [] Network Flow Algorithms: [] Maximum Flow [] Bipartite Matching [] Minimum Cost Flow [] Transshipment [] Transportation [] Linear Programming [] Computational Geometry: [] Convex Hull Scan [] LineSweep [] Nearest Neighbor Queries [] Range Queries []
Source
Algorithms /
Filename  Size  Date modified  Message 

comp_geometry  
graph  
network_flow  
path_finding  
searching  
sorting  
61 B

…  
1.5 KB

…  
360 B

…  
2.4 KB

… 