mikolalysenko / bipartite-vertex-cover

Minimal vertex cover for bipartite graphs
MIT License
4 stars 1 forks source link

Adding a break in walk function #1

Open jwalteros opened 7 years ago

jwalteros commented 7 years ago

Have you considered adding a break after line 22?

Once you have identified the next vertex you can stop traversing the adjList of v.