https://github.com/fatihbaltaci/wordladder-graphtheory

Shortest path between two words in a "word ladder" using Breath First Search with Java programming language.
https://github.com/fatihbaltaci/wordladder-graphtheory

Last synced: 10 days ago
JSON representation

Shortest path between two words in a "word ladder" using Breath First Search with Java programming language.

• Host: GitHub
• URL: https://github.com/fatihbaltaci/wordladder-graphtheory
• Owner: fatihbaltaci
• Created: 2017-02-08T00:55:38.000Z (over 7 years ago)
• Default Branch: master
• Last Pushed: 2017-02-22T15:32:42.000Z (over 7 years ago)
• Last Synced: 2023-09-07T15:13:50.149Z (about 1 year ago)
• Language: Java
• Homepage:
• Size: 4.88 KB
• Stars: 0
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# WordLadder-GraphTheory

Shortest path between two words in a "word ladder" using Breath First Search with Java programming language.

Given two words, which one is a start word and the other is an end word, and a dictionary, in a word ladder you have to change one word into another by shifting only one character at a time. In addition, the new word which is shifted must be in the dictionary. For example, a word ladder between 

"stop" and "fast" is:

stop - soop - loop - loot - lost - last - fast

Dictionary File is look like:

abbe 


abed 


abet 


able 


ably 


abut 


aced 


aces 


ache 


achy 


...  


Input File is look like: 

rose rage 


cook pour 


 Running the program 

```

javac Main.java

java Main   

```