MCQs>IT & Programming>Data Mining>Which of the following is most appropriate for finding the shortest chain of friends linking two people in a social graph who are not friends with each other?
Data Mining MCQs
Which of the following is most appropriate for finding the shortest chain of friends linking two people in a social graph who are not friends with each other?
Answer
Correct Answer: Dijkstra's algorithm
Explanation:
Note: This Question is unanswered, help us to find answer for this one