pixelfac / GraphLinker

1 stars 1 forks source link

Implement Dijkstra's Algorithm #11

Open pixelfac opened 2 years ago

pixelfac commented 2 years ago

Takes 2 strings, both handles of twitter users in the graph return distance if connected, -1 if not Implement solution in C:\Users\pixel\OneDrive\Documents\School\COP3530\GraphLinker\Unity_Project\Assets\Scripts\Pathfinder.cs

pixelfac commented 2 years ago

Edge weight = 1/followers (to prioritize pathing through celebs)