Given a situation: You have data about friend relationships from a social network, and you want to model the spread of a rumor based on these relationships. Your model is that a rumor starts with a single person, who then tells all of their friends. Then at each subsequent step, everyone who knows about the rumor spreads it to all of their friends who don't know it. What to do; you must select three answers:
-Specify the type of graph most appropriate for data in question in terms of un-directed or directed,
-Specify the type of graph most appropriate for un-weighted or weighted.
-Choose the graph algorithm that is best suited to computing a solution:
Breadth-First Search,
Minimum Spanning Tree (Prim's or Kruskal's),
Dijkstra's,
Depth-first search.
Breadth first search
Undirected graph
Unweighted
Weighted Dijkstra's