I was reading through http://langevin.univ-tln.fr/cours/PAA/extra/Tarjan-1972.pdf and saw the complexity of the biconnectivity algo. I know that the compleixity is O(V+E) for both, I was wondering what is the constant for the memory and time?
Constant time for tarjan's biconnectivity algothrim????
I was reading through http://langevin.univ-tln.fr/cours/PAA/extra/Tarjan-1972.pdf and saw the complexity of the biconnectivity algo. I know that the compleixity is O(V+E) for both, I was wondering what is the constant for the memory and time?
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en1 | I_Love_Michelle_Shen | 2015-07-18 06:53:02 | 298 | Initial revision (published) |