soniakeys
more tutorials
Any set of methods with a common theme and some level of completeness or coherency is a good candidate for a tutorial.
-
Representation The more common representations deserve their own tutorials but a representation overview would be good. This could replace the lengthy section of doc.go.
-
FromList There's the existing tutorial on AdjacencyList. One for FromList would be nice.
-
Spanning trees There are a few different algorithms.
-
SSSP Nice to have first would be better AStar tests, issue 44, and dot support for paths issue 2. Consider existing Dijkstra tutorial. After writing tutorial, remove the SSSP section from doc.go
-
Traversal Explain DF and BF, explain the API, also show how to hand code DF.
-
Dominance and SSA
-
Eulerian paths These functions could use some completion first.
-
DAGs, Topological sort Random DAG would be nice to have first.
-
Cliques, Bron-Kerbosch Another algorithm or two would be nice. Especially a near-clique algorithm.
-
Labeling Use of NIs and LIs for labeling, or associating properties. Relation to graph databases.
