During the construction of a home there are certain tasks that have to be comple
ID: 3547833 • Letter: D
Question
Explanation / Answer
8. Ans- We will have a nodes for each customer and nodes for each item. There exists an edge from customer node to item node if the customer buys that item. Each customer can buy an item only once(not the quantity). So multiple edges are not allowed. There does not exist any loops in the graph. All edges must be undirected. The graph can be bipartited into two sets of nodes with customers in one set and items in other set.
9. Dikjstra's algorithm follows the path from a->b->d->z . The total path length will be 3+2+4=9.
Related Questions
Hire Me For All Your Tutoring Needs
Integrity-first tutoring: clear explanations, guidance, and feedback.
Drop an Email at
drjack9650@gmail.com
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.