• 

  Lock

What I do

This project builds a graph from a list of words. In the graph created, each word is a vertex and edges exists between words that differ from each other by one simple transition. After it's created, the project implements WordProcessor and GraphProcessor that uses a dictionary graph and shortest path algorithm to find the shortest path between two words.

Description

Given a dictionary of words, implement a graph where the vertices are the words in the dictionary and the edges denote a difference of one character between two vertices. Differences can be any one of the below 3 types:

Substitution of 1 character Addition of 1 character Deletion of 1 character

In other words, an edge exists between two words if and only if one word can be converted to another with exactly one modification (1 substitution or 1 addition or 1 deletion). Below image shows a diagrammatic representation of graph for a dictionary of 9 words.

Credit to CS400 Assignment p4 Dictionary Graph

Built With

• java
• junit4