象形文字中的最长路径 [英] longest path in geraph

问题描述

你好一个
我想要一种算法来找到格拉夫最长的路径
谁能帮我
谢谢

hello evry one
i want an algorithm to find longest path in geraph
can any body help me
thank you

推荐答案

您的问题
1)与CP 指南 [ 2)缺少诸如图形种类之类的关键细节，如果性能/内存/...很重要，如果您要论文或代码，...?
3)不提供您尝试过的背景知识(问Goolge是当今最低的期望值)...

不过，我假设您现在拥有DAG-有向无环图 [ Google:DAG最长路径 [ http://en.wikipedia.org/wiki/Longest_path_problem [

Your question
1) is not in line with the CP guideleines[^]: "I want..." is at the edge of being impolite
2) lacks crucial details like graph kind, if performance/memory/... matters, if you ask for papers or code, ...?
3) does not give background of what you did try yourself (asking Goolge is the minimum one can expect nowadays)...

Nonetheless, I assume now you have a DAG - Directed Acyclic Graph[^]:
- Google: DAG longest path[^]
- http://en.wikipedia.org/wiki/Longest_path_problem[^]
- ...

Cheers
Andi

这是一个愚蠢的请求，因为图中的最长路径始终可以是无限的.

This is a silly request since the longest path in a graph can always be infinite.

这篇关于象形文字中的最长路径的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！