Current Behavior

The descriptions of algorithms are missing, so it is hard to know which are suitable. If one approaches the NetworkX without thorough background knowledge of graphs, they may not understand which of them would be helpful without a lengthy comprehensive googling.

Expected Behavior

There can be an overview of the high-level working of the graph algorithms with an image.

Steps to Reproduce

For example, if one does not know what a cut is, they will need to google when looking at this example.

Environment

Python version: any
NetworkX version: any

@MridulS , @dschult, @rossbar