Graph G2 showing adjacent two-letter Web2 words; the horizontal lines connect words that differ in their first letter, and the vertical lines connect words differing in their second letter. (The heavier blue lines represent the shortest-path spanning tree from an.)
Diameter(G2) = 4
Graph G3 showing adjacent three-letter words (the three blue dots highlighting edh, its, and nth, which have no neighbors):
© 2001–2024 Robert Dickau
[ home ] || [ 2001-04-15 ]
www.robertdickau.com/wordgraph.html