> A good example of this this technique is to model Internet AS paths; give every AS number a unique prime number (there are only about 100k of them) and model

> A good example of this this technique is to model Internet AS paths; give every AS number a unique prime number (there are only about 100k of them) and model AS path as the composite of its component ASes; using vectorized DIV/MOD instructions it is incredibly fast to large graph operations. AS paths are ordered; what interesting graph algorithms could be performed on paths in which order has been lost?