Osion kuvaus

  • Part I - Conclusion

    In Part I of this course, we focused on graph problems, especially those problems that have an efficient algorithm to obtain a solution.

    Among those, we emphasized: connectivity, shortest path, minimal spanning tree, maximum flow and maximum matching.

◄ Previous section
Week IV - Matching
Next section ►
Week V - Complexity and TSP