CS170 编程辅导, Code Help, WeChat: powcoder, CS tutor, [email protected]
-
Updated
Nov 22, 2022 - C
CS170 编程辅导, Code Help, WeChat: powcoder, CS tutor, [email protected]
Minimum cover dominating set application
Given a graph of |V| students, |E| friendships, B buses, and L "troublemaker groups", assign all the students to buses in a way that maintains as many friendships as possible! Code and project reports for a maximally-connected, K-clusters approximation algorithm which uses the NetworkX library.
Add a description, image, and links to the cs170 topic page so that developers can more easily learn about it.
To associate your repository with the cs170 topic, visit your repo's landing page and select "manage topics."