Minimal vertex set [2008-09-08 19:40:44] Given a graph (any type - Directed acyclic graph or undirected graphs with loops), find a minimal set of vertices which affect all the edges of the graph. An edge is affected if the edge is either originating or terminating from that vertex. Author:prem Tags: algorithms | coding | c++ 1 Comment Answer: From: Anon Registered User(Click here if you are a new user) User name Password Login Title: (numbers only) Comment:

Answers:

answer [2008-11-03 07:04:29] Traverse through all the vertices & check if the no. of edges originating from a particular vertex is equal to the total no. of edges. Author:Anon