[英]Can we apply Viterbi algorithm if there are cycles in a graph?
我正在尝试解决可以通过BFS和viterbi算法解决的问题。 但是,如果图中存在循环,则BFS可能会失败。 所以我的问题是维特比算法循环安全吗?
只要确保您的图遵循隐马尔可夫模型的规则(例如,每个节点的所有出站边的总和为1),那么是的- 维特比算法可以处理循环图。
很难说这是否确实是正确的选择,还是您可以在没有更多问题上下文的情况下使用经过修改的BFS。
[英]How to Apply Viterbi Algorithm in Python
[英]Can we apply the Bellman-Ford algorithm to an Undirected Graph?
[英]Modification of an algorithm for detecting cycles in a graph
[英]Algorithm for finding minimal cycles in a graph
[英]graph algorithm to detect even cycles
[英]DFS algorithm to detect cycles in graph
[英]Understanding the Viterbi algorithm
[英]Understanding Viterbi Algorithm
[英]Viterbi algorithm in linear time
[英]Best parallel algorithm for detecting cycles in a undirect graph
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.