c*****u
发帖数: 530 | 1 Do you guys know any efficent algorithm to do so? Thanks |
s***e
发帖数: 284 | 2 Tarjan's algorithm O(|V|+|E|)
【在 c*****u 的大作中提到】
: Do you guys know any efficent algorithm to do so? Thanks
|
c******n
发帖数: 4965 | 3 what do you mean?
the number of cycles may be exponential
【在 s***e 的大作中提到】
: Tarjan's algorithm O(|V|+|E|)
|
r*****t
发帖数: 286 | 4 faint, I highly suspect your conclusiion.
【在 s***e 的大作中提到】
: Tarjan's algorithm O(|V|+|E|)
|
c*****u
发帖数: 530 | 5 I think this is a NP problem as well
Tarjan's algorithm could only find all strongly connected components
【在 c******n 的大作中提到】
: what do you mean?
: the number of cycles may be exponential
|
a******e
发帖数: 95 | 6
I think you need to study what NP is in the first place.
【在 c*****u 的大作中提到】
: I think this is a NP problem as well
: Tarjan's algorithm could only find all strongly connected components
|
a**m
发帖数: 151 | 7 Tarjan SIAM J. Comput. 1973
【在 c*****u 的大作中提到】
: Do you guys know any efficent algorithm to do so? Thanks
|
