Justify the graph approach some more

ICHLL_Brenon.md

@@ -189,10 +189,15 @@ the shortest path is meaningful in general, it at least provides us with an
 efficient way to check whether a given element may or not be nested at all under
 another one and gives an order of magnitude on the length of the path to expect.
 Of course the accuracy of this heuristic decreases as the length of the elements
-increases in a perfect graph representing the intended, meaningful path between
-two nodes, but the general graph formalism enables us to extend the results
-produced by the shortest-path approach and consider elements combinations
-rationally and exhaustively by algorithmic means should the need occur.
+increases in the perfect graph representing the intended, meaningful path
+between two nodes that a human specialist of the TEI framework could build. This
+is still very useful when taking into account the fact that TEI modules are
+merely "bags" to group the elements and provide hints to human encoders about
+the tools they might need but have no implication on the inclusion paths between
+element which cross module boundaries freely. The general graph formalism
+enables us to describe complex filtering patterns and to implement queries to
+look for them among the elements exhaustively by algorithmic means even when the
+shortest-path approach is not enough.
 
 For instance, it lets one find that although `<pos/>` may not be directly
 included within `<entry/>` elements to include information about the