v1.11.0

Graphs v1.11.0

Diff since v1.10.0

Merged pull requests:

• added iterators for dfs and bfs (#163) (@kylebeggs)
• Modify non_backtracking_matrix function's Return Type (#328) (@KeishiS)
• Small doc update for random_configuration_model (#360) (@dave7895)
• Fix dfs_tree doc. (#367) (@iago-lito)
• Fix steiner tree and Kruskal (#368) (@etiennedeg)
• fix merge_vertices (#369) (@etiennedeg)
• Faster dorogovtsev mendes (#371) (@AntoineBut)
• Avoid materializing intermediate adjacency list (#372) (@simsurace)
• Minor release (#373) (@gdalle)
• Remove CI on nightly (#374) (@gdalle)

Closed issues:

• Question regarding non_backtracking_matrix function's return type (#326)
• Inconsistent dependency on ArnoldiMethod (#354)
• [BUG] edges(::SimpleGraph) is broken in 1.10.0 (#361)
• [BUG] steiner_tree fails if only one terminal vertex is passed (#362)
• [BUG] merge_vertices returns an undirected graph, even if the input is directed. (#363)
• Incorrect documentation for dfs_tree. (#366)
• dorogovtsev_mendes graph generator is running in O(n^2) (#370)