Assignment 2 test case: bear

Input file:

bear beat beer dear deer fear feat hear heat meat near neat pear rear seat tear wear year

Output:

Dictionary
0: bear
1: beat
2: beer
3: dear
4: deer
5: fear
6: feat
7: hear
8: heat
9: meat
10: near
11: neat
12: pear
13: rear
14: seat
15: tear
16: wear
17: year
Ordered Word Ladder Graph
V=18, E=67
<0 1> <0 2> <0 3> <0 5> <0 7> <0 10> <0 12> <0 13> <0 15> <0 16> <0 17> 
<1 0> <1 6> <1 8> <1 9> <1 11> <1 14> 
<2 0> <2 4> 
<3 0> <3 4> <3 5> <3 7> <3 10> <3 12> <3 13> <3 15> <3 16> <3 17> 
<4 2> <4 3> 
<5 0> <5 3> <5 6> <5 7> <5 10> <5 12> <5 13> <5 15> <5 16> <5 17> 
<6 1> <6 5> <6 8> <6 9> <6 11> <6 14> 
<7 0> <7 3> <7 5> <7 8> <7 10> <7 12> <7 13> <7 15> <7 16> <7 17> 
<8 1> <8 6> <8 7> <8 9> <8 11> <8 14> 
<9 1> <9 6> <9 8> <9 11> <9 14> 
<10 0> <10 3> <10 5> <10 7> <10 11> <10 12> <10 13> <10 15> <10 16> <10 17> 
<11 1> <11 6> <11 8> <11 9> <11 10> <11 14> 
<12 0> <12 3> <12 5> <12 7> <12 10> <12 13> <12 15> <12 16> <12 17> 
<13 0> <13 3> <13 5> <13 7> <13 10> <13 12> <13 15> <13 16> <13 17> 
<14 1> <14 6> <14 8> <14 9> <14 11> 
<15 0> <15 3> <15 5> <15 7> <15 10> <15 12> <15 13> <15 16> <15 17> 
<16 0> <16 3> <16 5> <16 7> <16 10> <16 12> <16 13> <16 15> <16 17> 
<17 0> <17 3> <17 5> <17 7> <17 10> <17 12> <17 13> <17 15> <17 16> 
Longest ladder length: 10
Longest ladders:
 1: bear -> dear -> fear -> hear -> near -> pear -> rear -> tear -> wear -> year

RETURN TO ASSIGNMENT 2

Assignment2Ex2 (last edited 2019-07-22 09:37:27 by AlbertNymeyer)