maxinexiong / degrees-of-separation-with-breadth-first-search Goto Github PK
View Code? Open in Web Editor NEWThis project utilizes PySpark RDD and the Breadth-first Search (BFS) algorithm to find the shortest path and degrees of separation between two given Marvel superheroes based on based on their appearances together in the same comic books, empowering users to discover connections between their favourite superheroes in the Marvel universe.
Home Page: https://maxinexiong.github.io/dark-mode/projects/spark.html#spark-marvel