Skip to content

fzehracetin/graph-operations-using-breadth-first-search-algorithm-

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

13 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Graph Operations Using Breadth First Search Algorithm

In this program we have a file called kelime.txt and we are trying to make operations using it. The operations that we are make is listed below.

  1. Make an adjacency matrix from words in file.

  2. Look for adjacency between two words.

  3. For a given two words if there is transformation between them show it step by step. In every step, only one charachter can change.

Example:

first word: phone
second word: green

This is transformation between them :

phone ->shone ->shine ->chine ->chink ->chick ->check ->cheek ->creek ->creed ->greed ->green

In every step only one character changed.

About

Make the adjacency matrix and traverse the graph using the Breadth-First Search Algorithm.

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages