Function spec_order_all

pub fn spec_order_all<G>(graph: &G) -> Vec<GraphElem<G::V, G::E>>
where
    G: FinGraph,
    G::V: Hash,

Arrange all the elements of a finite graph in specialization order.

The specialization order is the preorder associated with the Alexandrov topology on the graph. Equivalently, it is the preorder reflection of the category of elements of the graph. In simple terms, this means that every edge is greater than its source and its target.

This function computes a total ordering of the elements of the graph that extends the specialization order. Such a total ordering is precisely a topological ordering on the category of elements of the graph. The particular ordering is computed using breadth-first search, which ensures that edges are close to their sources and targets (while still always being greater than them).