c ++图中的关键路径问题 [英] critical path problem in graph for c++

问题描述

如何编写代码在图中找到由顶点组成的关键路径，这样每个顶点代表一个具有开始时间和持续时间来完成的任务

note ::没有循环图表

有一定的开始和结束点

解决方案

对关键路径的简单搜索得到了：

http://en.wikipedia.org/wiki/Critical_path_method [ ^ ]

你为什么不亲自搜索？



PS：

对不起，乍一看，链接似乎描述了一个算法，但显然主题不是关于如何找到CP。 br />


无论如何，挖掘进一步揭示了这个Wiki主题，其中至少包含一些有用的链接和信息： http://en.wikipedia.org/wiki/Longest_path_problem [ ^ ]

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

解决方案

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[^]

这篇关于c ++图中的关键路径问题的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！