There are a number of named graphs defined in networkx.generators.small that are not well-documented:

https://github.com/networkx/networkx/blob/766becc132eda01c9d0d458de2d75ab763f83493/networkx/generators/small.py#L183-L575

Each of these functions should have a more extensive docstring with at least a Parameters, Returns, and Examples section, and preferably also a reference to the c

steps to reproduce

Write a loop, from 1 to 80000, each time add a random int to the max heap.

In theory it takes very little time(NlogN, N=80000, <1sec ), but the program does take a long time.

I'v also tested the BinaryHeap in https://github.com/SolutionsDesign/Algorithmia, it performs well, so it is probably due to the bad algorithm.

https://en.wikipedia.org/wiki/INI_file

We need to move the execution of CLI scripts used to build the documentation into a Make file. Wise suggestion from @louisguitton: DerwenAI/pytextrank#159 (comment)

Feature description (Mandatory)

Please add the capability to specify the type of array instead of defaulting to string. i.e.
apoc.array.int()

How this feature can improve the project?

By default, it is created as a string. Some customers have asked for the ability to hint at the data type.

igraph_random_edge_walk() takes weights, but igraph_random_walk() does not. igraph_random_walk() should also be extended to take a weights argument.

The underlying weighted implementation of random_walk() can mirror random_edge_walk() but it should be separate from the unweighted one. This is because the unweighted one uses an adjlist, while the weighted one needs an inclist. At th