![]() |
Weekly Problems #09 |
| Pedro Ribeiro - DCC/FCUP |
This is one of 11 weekly problem sets. Each one is worth 10% of the grade of the "Submitted Implementation" evaluation criteria.
6 proposed problems:
- Use Dijkstra's algorithm to go from one corner to the other
- You can adapt Dijkstra for this problem
- Can you think on the solution if K is zero? What is the correct relaxation of an edge?
- You should consider K+1 states for each node (without any renovations made, with 1, with 2, ... , with K)
- Can you think on how to use Bellman-Ford here?
- Maximum Bipartite Matching
- Can you think on how to adapt Kruskal algorithm for this task?
- One for you to solve alone? :)
About the delivery:
Pedro Ribeiro - DCC/FCUP | Last update: