Extremities and orderings defined by generalized graph search algorithms

We define Algorithm MLS which uses a labelling structure to generalize all known graph searches which compute a peo on a chordal graph, as well as its extension MLSM, which computes an meo on an arbitrary graph. We also examine the vertices numbered as 1 by these algorithms, and show how they can be seen as extremities of the graph.