About Page
They both use Graph Theory,
After watching a video from Stuff Made Here using graph theory to build a basketball hoop where the shot always lands in, I was curious to learn more how to incorporate graph theory into my own project.
Seperately, I noticed that in some names on a keyboard, all the letters are adjacent to each other.
"DREW" can be spelled "D" -> "R" -> "E" -> "W", moving between letters adjacent to their corners.
But what about more complicated names like "SCOTT" or "WASHINGTON"? How could you determine the shortest path between the letters? How would you know where to go?
With these two ideas, I worked on this project to make a program that determine the shortest path between letters for any name and sum up the "distance" score for each name. What is the shortest path for each name depending on the name length?