Implementation of Dijkstra's algorithm on one frequent term (plus one
randomly chosen adjacent node) done (re-implementation).
New class : SemiNode (for the TextParser class).
Progressive removal of a limited execution of the algorithm (must now
perform D's Algorithm with the full node list loaded).
Unused code removed, and other chunks commented, waiting for definitive
removal.