- Forum
- General C++ Programming
- graph algorithm
graph algorithm
G is a directed graph.
There may be some cycles in G.
There may be some seperate sub-graph in G
Now, make k(>=1) steps
in step i, select si vertices.
if si == 0, enter the next step
if si >= 0, these vertcies should construct a simple path(has no cycle), delete these vertices from G, enter the next step.
maximize s1+s2+...+si+...+sk
There may be some cycles in G.
There may be some seperate sub-graph in G
Now, make k(>=1) steps
in step i, select si vertices.
if si == 0, enter the next step
if si >= 0, these vertcies should construct a simple path(has no cycle), delete these vertices from G, enter the next step.
maximize s1+s2+...+si+...+sk
Ok, not a very clear recap of what your assignment is, now do you have any code you've written to solve it?
if you can solve it, help me. You just need to give me some documents, i will research on them.
Topic archived. No new replies allowed.