Implemented Breadth-first search, Depth-first search and Uniform-cost search using distance of their relationship as cost, to find path between two people in the social network
-
Notifications
You must be signed in to change notification settings - Fork 0
riteshnaik/Uninformed-Search-in-Social-Network
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Implemented Breadth-first search, Depth-first search and Uniform-cost search using distance of their relationship as cost, to find path between two people in the social network
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published