[deps] Update networkx requirement from <3.5,>=2.6 to >=2.6,<3.7

[dependabot[bot]]

Updates the requirements on networkx to permit the latest version.

Release notes

Sourced from networkx's releases.

NetworkX 3.6

networkx 3.6

We're happy to announce the release of networkx 3.6!

New Features

• ENH: add normalize option for subgraph_centrality and its _exp version (#8340).

API Changes

• Replace random_lobster with random_lobster_graph (#8067).
• Replace maybe_regular_expander with maybe_regular_expander_graph (#8050).
• Rm networkx.algorithms.threshold.swap_d (#8213).
• Expire deprecation of compute_v_structures (#8281).
• Rm unused dissuade_hubs kwarg from forceatlas2 (#8293).
• Expire deprecation of link kwarg in node_link fns (#8282).
• DEP: Deprecate metric_closure (#8304).

Enhancements

• Improve error message for removed random_tree function (#8105).
• Update approx current_flow betweenness to use k directly (#8007).
• Proposal: update semantics for nonisomorphic trees with order 0 or 1 (#8083).
• SCC benchmarks and use of G._adj in Tarjan algorithm (#8064).
• Performance improvement and tests for edges_equal (#8077).
• optimise is_reachable() (#8112).
• Optimise harmonic centrality (#8158).
• feat(drawing): add missing connection styles in draw_networkx_edge_labels and display (#8108).
• Optimizing Dijkstra's paths to target (~50x faster for graphs with multiple-hops shortest path) (#8023).
• Add all_triangles generator yielding all unique triangles in a graph (#8135).
• refactor: simplify k_factor (#8139).
• feat: add directed star graph (#8151).
• Faster intersection_array computation for checking distance-regularity (#7181).
• enh: short-circuit in is_regular for directed graphs (#8138).
• Avoid re-exploring nodes in Kosaraju's SCC algorithm (#8056).
• trust rank implementation and testing (#8165).
• Add hyper_wiener_index function (#8184).
• Bidirectional dijkstra optimization: from 1.1x to 25x faster (#8206).
• Implement the algorithm to find the centroid(s) of a tree (#8089).
• Set length threshold in FR and use np.clip (#8145).
• Add panther++ (#4400).
• maint: use nx.circulant_graph to generate Harary graphs (#8189).
• ENH: add directed kwarg to edges_equal (#8192).
• Optimizing Dijkstra's path construction for all targets case (#8218).
• ENH: adds ISMAGS support for directed and multigraph with tests and refactor (#8274).
• Dispatch classes such as nx.Graph(backend=...) (#7760).
• ENH: Add is_perfect_graph using SPGT (follow-up to #8111) (#8318).
• Add benchmark suite for shortest path algorithms on weighted graphs (#8059).
• Adding Generalized Petersen Graph (#8147).

... (truncated)

Commits

• bb9a6de Designate 3.6 release
• 4369736 Fix sphinx warnings 3.6rc (#8352)
• 6dbed05 FEAT: Add a describe method for some basic info about graphs (#8338)
• 5fa842b Pin last value to 1.0 in cumulative_distribution to address floating-point ...
• d302ea1 Adding @​amcandio as contributor (#8345)
• 1c64369 DOC: Add warning about special GEXF reserved keywords. (#8343)
• f26e6bf ENH: add normalize option for subgraph_centrality and its _exp version (#...
• 79e113b Adding Generalized Petersen Graph (#8147)
• 8b1c5a1 Bump actions/upload-artifact from 4 to 5 in the actions group (#8335)
• e79901a Fix formatting for release docs. (#8336)
• Additional commits viewable in compare view

Dependabot will resolve any conflicts with this PR as long as you don't alter it yourself. You can also trigger a rebase manually by commenting @dependabot rebase.

---

Dependabot commands and options

You can trigger Dependabot actions by commenting on this PR:

• @dependabot rebase will rebase this PR
• @dependabot recreate will recreate this PR, overwriting any edits that have been made to it
• @dependabot merge will merge this PR after your CI passes on it
• @dependabot squash and merge will squash and merge this PR after your CI passes on it
• @dependabot cancel merge will cancel a previously requested merge and block automerging
• @dependabot reopen will reopen this PR if it is closed
• @dependabot close will close this PR and stop Dependabot recreating it. You can achieve the same result by closing it manually
• @dependabot show <dependency name> ignore conditions will show all of the ignore conditions of the specified dependency
• @dependabot ignore this major version will close this PR and stop Dependabot creating any more for this major version (unless you reopen the PR or upgrade to it yourself)
• @dependabot ignore this minor version will close this PR and stop Dependabot creating any more for this minor version (unless you reopen the PR or upgrade to it yourself)
• @dependabot ignore this dependency will close this PR and stop Dependabot creating any more for this dependency (unless you reopen the PR or upgrade to it yourself)