Where to find implementations of things

Note

This is mostly for my own reference. Things are in alphabetical order. Sorry for terrible formatting.

Dijkstra

• Dijkstra
• Bumps (for nodes referenced by characters)
• DuelingGPS - shortest path to all nodes

Sweep Line Stuff

• CowSteeplechase (2D segment intersection, lots of computational geometry stuff - points, segments, intersection, etc.)
• Stampede (1D segment sweepline)
• CowJog(1D segment overlap)
• CowJogSimplified(1D segment overlap, but way simpler than what I was doing before - look to it for inspiration for clean solutions with segments)

Min spanning tree

• SuperBullPrim (prim's minimum spanning tree)

Safe Combinatorics(inversions, multiplication, factorials, combinations)

• CountTheArrays

Floodfill

• IcyPerimeter
• CaveAdventure

String Manipulation

• PrefSuffPalindrome - prefix function
• CensoringSilver - KMP

Graph stuff

• Piggyback - BFS
• MilkVisits - DFS to find disconnected componenets in a graph
• CowCrossTheRoad3 - 2D grid with implicit graph
• LuxuryRiverCruise - Floyd's tortoise and hare cycle finding algorithm(Video)
• LuxuryRiverCruise - non traditional cycle finding / graph formulation.
• Tractor - BFS for shortest path on a grid

String Sorting/Prefix matching

• AutoCompletion