MCPcopy Create free account
hub / github.com/TheAlgorithms/Python / greedy_min_vertex_cover.py

File greedy_min_vertex_cover.py

graphs/greedy_min_vertex_cover.py:None–None  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

1"""
2* Author: Manuel Di Lullo (https://github.com/manueldilullo)
3* Description: Approximization algorithm for minimum vertex cover problem.
4 Greedy Approach. Uses graphs represented with an adjacency list

Callers

nothing calls this directly

Calls 1

greedy_min_vertex_coverFunction · 0.85

Tested by

no test coverage detected