Problem
Let G = (V, E) be a directed graph with weighted edges. We are interested in the set of vertices I = {ν|ν ε V, ∃u ε V s.t. d(u, ν) = -∞}. That is, the set of vertices v such that there is at least one path of length -co ending at v.
1. Describe an intuitive approach for generating the set I.
2. Write pseudocode for a function findSetI (G) which returns the set I for a given graph.
3. Analyze the asymptotic run time of your algorithm.