Update docs on algorithms by adding the complexity info

[matea16]

We recently had users asking questions about the time and computational complexity of our algorithms. That's an important part of the algorithm's performance so it would make sense to have that info in our docs.

Context:
difference between algo.all_simple_paths() and BFS in terms of computational complexity
community_detection algorithm

Related issue:
#830