An Algorithm to find a Minimum Vertex Cover in a Graph with an Implementation in Rust.

The minimum vertex cover of a graph is a set of vertexes of minimal size such that every edge in the graph shares at least one vertex with it. So, if C is such a cover and you pick any edge e = {u, v}, then u or v are within C. Moreover, no other set with this property has a size less than that of C.

--

--

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store
applied.math.coding

applied.math.coding

526 Followers

I am a mathematician and software developer who likes writing advanced code and to do research in applied and pure mathematics.