00:01
Hello students, name the algorithm.
00:03
In the many applications like the social media, the app suggests a list of the friends that a particular user may know.
00:10
So this feature may be implemented on a system that has an overall billion users.
00:16
So which algorithm is the best to implement this feature? so it is the, so the correct answer is the digistars algorithm.
00:26
It is the digistars algorithm.
00:33
So with digistars algorithm, in context of suggesting the friend that a particularly a user may know in a social media application with a massive number of the users, so the algorithm that is typically best suited is the digistars algorithm.
00:52
So whereas it is used to find the shortest path, it is used to find the shortest path, the shortest paths between the nodes in a graph, between the nodes in a graph, between the nodes in a graph.
01:21
So and it can be used to find the shortest connection or the path between the user in a social media graph...