Given a graph with weighted edges, how can we find a negative cycle that contains at least one vertex in a given vertex set $\{V_1, V_2, \ldots, V_k\}$? Thanks.
Find negative cycle with vertex constraints
ds.algorithms;graph theory