Fig. 4From: Analysis and visualization of large networks with program package PajekSearching for shortest paths example: Changing ‘water’ into ‘wine’ in four steps (by changing, adding and removing a single letter in each step) in Knuth’s dictionary networkBack to article page