algorithms
Saturday, September 18, 2010
Find universal vertex in given graph represented as adjacency matrix.
How to find universal vertex in a graph represented as adjacency matrix in o(V) time.
Universal vertex has |V|-1 incoming edges and 0 outgoing edges.
No comments:
Post a Comment
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment