Spanning trees

Question

What is the time complexity of kirchoff's theorem used for finding number of spanning trees possible of undirected graphs?

Comments

In Kirchoff's algorithm, we calculate answer just by performing some matrix operations!! So complexity will be O(v³).

---

@Utkarsh Joshi It would take O(V²) right? Since manipulations on the adjacency matrix take constant amount of time. So time complexity becomes O(V²).O(1)= O(V²).

---

But we have to find a cofactor also.

---

But we need to compute the cofactor of only one element of the matrix.  So the time taken to find the cofactor should be added to O(V²) and not multiplied with it..isnt it?