When use fibanocci heap dijkstra take O(E+VlogV). Kruskal always takes O(ElogE+VlogV) .. Ei s O(V^2) so T=O(2ElogV+VlogV) or
O( ElogV)(assuming graph is not a sparse graph)
DFS is implemented using stack
BFS O(E+V) =O(E) (again assuming graph is a dense graph)