Skip to content
/ min_edge_cover Public

In graph theory, an edge cover of a graph is a set of edges such that every vertex of the graph is incident to at least one edge of the set.

en.wikipedia.org/wiki/edge_cover
0 stars 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

VardGH/min_edge_cover

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

1 Commit

a.out

a.out

 
 

graph.cpp

graph.cpp

 
 

graph.hpp

graph.hpp

 
 

input.cpp

input.cpp

 
 

input.hpp

input.hpp

 
 

input.txt

input.txt

 
 

main.cpp

main.cpp

 
 

About

In graph theory, an edge cover of a graph is a set of edges such that every vertex of the graph is incident to at least one edge of the set.

en.wikipedia.org/wiki/Edge_cover
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages