-
vertex_cover_forest.cpp
Algorithm for finding the minimum vertex coverage of the forest
Input format
The first line contains the number of vertices V (0 < V <= 1000). Each of the following V lines describes an adjacency list of a vertex u that is next in order and consists of the number of adjacent vertices d(u) (0 < d(u) <= 1000) and the ordered list of adjacent vertices following this number. Vertices are numbered from scratch.
Output format
Minimum vertex coverage size.
-
Notifications
You must be signed in to change notification settings - Fork 0
sibsonya/Algorithms_and_Data_Structures
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Algorithms and data structures on c++ and python
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published