Maths Problem?

[Corbin S]

We are given an undirected graph G = (V,E) in adjacency list
representation. Give an algorithm that computes the minimum size of a set C V such that
for all vertices v 2 V , we have v 2 C or there exist an edge (u, v) 2 E such that u 2 C.
It was actually for a quiz, and Ive submitted the answers now, but none the less I didnt answer this one

Thank you all who wern't like "wtf" or added me to there ignore list

[tomson21]

sorry have no idea

[eastanglianuk1951]

It would be useful to say what level of college this came from, so we know not to click on it thinking we have a school child needing help. I have added you to my ignore list.

[pretty thang]

there is no question in that but g=v,e you just trying to be a clever arse

[wild_eep]

ignore all these lowbrow grunts

'fraid I can't help you either (grunt, but not lowbrow)