My method of making graph connected works nearly by O(N^2). Are there any classic algorithmes for such problem?

You should use the system of disjoint sets.