Deriving a class of layer-oriented graph algorithms

We survey an algebra of formal languages suitable to deal with graph algorithms. As an example of its use we derive a general scheme for layer-oriented graph traversal. This general scheme is then applied to a reachability and a shortest path problem.