Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

08_greedy_algorithms/python/01_set_covering.py #115

Open
T-CHARE opened this issue Apr 22, 2019 · 0 comments
Open

08_greedy_algorithms/python/01_set_covering.py #115

T-CHARE opened this issue Apr 22, 2019 · 0 comments

Comments

@T-CHARE
Copy link

T-CHARE commented Apr 22, 2019

......
for station, states in stations.items():
covered = (states_needed & states)
if len(covered) > len(states_covered):
best_station = station
states_covered = covered
......

should be like this:

......
for station, states in stations.items():
covered = (states_needed & states).union(states)
if len(covered) > len(states_covered):
best_station = station
states_covered = covered
......

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant