This application finds the relationship of actors using breath - first search algorithm. This is my own version of "Six degrees of Kevin Bacon" game.
Big O analysis
Worst case time performance:
Ο(|V|+|E|) = Ο(bd)
Worst case space complexity:
Ο(|V|) = Ο(bd)
Where
V : number of vertices of the graph
E : number of edges of the graph
d : the depth of the solution (the shortest path)
b : the branching factor
Click here to open the project
About Author

I’m Viet, the founder of this website with 8+ years experience in data analytics. My sharing is focus on data, which specialise on both Analytics and Business Intelligence platform as well as Data Science and Machine Learning platform.