Are learning algorithms, data structure class set to do a critical path,
Critical path algorithm is realized, but I now want to output more than the critical path, oneself is originally wanted to use tag arc to traverse, but if the figure become

-- -- -- -- -- - & gt; B
A -- -- -- -- -- -- -- & gt; D -- -- -- -- -- - & gt; F a but mark D - F the arc, then failed,
-- -- -- -- -- -- -- & gt; C

SCDN retrieval 'key paths but could not find what you want,

If a friend to share ideas and share method to find out, I would like to organize and publish the CSDN and tagging ideas of the author,