In this project, we implement a social network using the graph data structure. In this network, each node plays the role of a person and the edges between them indicate the connection between them. This network uses the Heap data structure to suggest similar people to the user, which is done through an algorithm (DFS algorithm) to score and sort the people with the highest score (the most similar) and show them to the user.
generated from amirali079/Graph-Project
-
Notifications
You must be signed in to change notification settings - Fork 0
UI-DS-02/social-network-es-team
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
social-network-es-team created by GitHub Classroom
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published