Shunting or Routing Algorithms
Shunting or routing algorithms are distributive algorithms that move information through a structured system, or dictate what information goes where. There are four main types of shunting algorithms:
Isolation and symmetry breaking are the simplest of the routing algorithms. They are basically tie-breakers; where, in an algorithm that operates hierarchically, there are two values of the same rank, such an algorithm prevents an eternal standoff.
Random re-ordering algorithms mix a series of inputs for a naive algorithm that might perform its worst if the entries were in a certain order. A good example of this is the deterministic Quicksort algorithm, that performs its worst on a series that is already almost in order.
Load balancing algorithms are primarily used in parallel systems. They randomly route information from overloaded systems to systems that are standing idle.
Graph traversal algorithms shunt not so much information, but the focus of the program itself. They are used to walk through graphs or find the shortest point from one point to another.