The inspiration of this problem comes from an exam problem which I extended beyond limits of exams .
We are given a graph with edge weights which can be negative . There might be negative cycles as well in the graph. Given a vertex v, find the smallest simple cycle containing v.
This is an NP Hard problem actually as I later found out.
ReplyDelete