https://github.com/bhanuvikasr/six-degrees-of-separation
Designing and implementing efficient graph-based data structures to explore large graphs
https://github.com/bhanuvikasr/six-degrees-of-separation
bfs-algorithm graph-algorithms union-find
Last synced: 29 days ago
JSON representation
Designing and implementing efficient graph-based data structures to explore large graphs
- Host: GitHub
- URL: https://github.com/bhanuvikasr/six-degrees-of-separation
- Owner: bhanuvikasr
- Created: 2017-05-22T22:42:35.000Z (over 8 years ago)
- Default Branch: master
- Last Pushed: 2017-05-22T22:52:39.000Z (over 8 years ago)
- Last Synced: 2025-03-24T11:52:48.613Z (7 months ago)
- Topics: bfs-algorithm, graph-algorithms, union-find
- Language: C++
- Homepage: https://sites.google.com/a/eng.ucsd.edu/cse-100-fall-2016/assignments/assignment-4-readme
- Size: 222 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Six-degrees-of-separation
## Abstract
In this assignment we explore the "Six Degrees of Kevin Bacon" game. Specifically, we designed and implemented the data structures and algorithms necessary to explore degrees of separation between Hollywood actors that act in the same movies. The main focus of this assignment is to design and implement efficient graph-based data structures and use them to explore large graphs.