Skip to content

Latest commit

 

History

History
6 lines (5 loc) · 632 Bytes

File metadata and controls

6 lines (5 loc) · 632 Bytes

Graphs and Algorithms

  1. Solve these problems from BGCoder:
    • Algo Academy March 2012 - Problem 05 - Friends of Pesho
    • Algo Academy February 2013 - Problem 04 - Salaries
  • You are given a cable TV company. The company needs to lay cable to a new neighborhood (for every house). If it is constrained to bury the cable only along certain paths, then there would be a graph representing which points are connected by those paths. But the cost of some of the paths is more expensive because they are longer. If every house is a node and every path from house to house is an edge, find a way to minimize the cost for cables.