Click here to Skip to main content
15,563,248 members
Please Sign up or sign in to vote.
0.00/5 (No votes)
See more:
how can i write a code find the critical path in graph which consist of vertices such that each vertex represent a task which have a start time & duration to finish
note::there no cycle in the graph
there is certain start & end point
Posted
Updated 27-Nov-14 8:30am
v2
Comments
Stefan_Lang 28-Nov-14 2:11am    
This is not a C++ question. If you don't know how to program a specific thing in C++, please reformulate the problem and be much more concise. If not, you'd better move the question to the algorithms subforum - and be more concise as well!

In any case there's too little information to understand what it is that you need help with.

1 solution

A simple search on "Critical path" got this:
http://en.wikipedia.org/wiki/Critical_path_method[^]
Why didn't you do that search yourself?

P.S.:
Sorry, on first glance, that linked seemed to describe an algoriithm, but apparently the topic is not about how to find the CP.

Anyway, digging further revealed this Wiki topic which does contain at least a couple of useful links and information: http://en.wikipedia.org/wiki/Longest_path_problem[^]
 
Share this answer
 
v2

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)



CodeProject, 20 Bay Street, 11th Floor Toronto, Ontario, Canada M5J 2N8 +1 (416) 849-8900