Data Structures Lab #6 Solution

Description

Instructions

Implement the following graph algorithms:

– Kruskal’s algorithm

– Topological sort

Feel free to use the instructor’s implementation of the Disjoint Set Forest and Graph data structures. Do at least one of the following to test your implementations:

– Unit Tests

– Creating a separate file where you call your implementations using hard-coded graphs

What you need to do

Part 1 Implement the program described above and upload your code to GitHub.

Extra Credit (5 points total)

Solve the following LeetCode Problems

1. https://leetcode.com/problems/minimum-height-trees/description/
2. https://leetcode.com/problems/reconstruct-itinerary/description/