Python-graphblas

Enhancements
------------
- Support NetworkX 3.2, which made many improvements to dispatching (68, 77, 78)
- Add support for Python 3.12 (79)
- Drop support for Python 3.8 (77)

Enhancements
------------
- Prepare for SuiteSparse:GraphBLAS 8 (478, 456)
- Version 8 added SuiteSparse-specific context objects and JIT
- Support coming in the next release of `python-graphblas`
- Documentation improvements:
- Add section about relationships to other Python libraries to README (442)
- Fix images to show up in README on PyPI (450)
- Fix to use double backticks instead of single backticks in docs (454)
- Blacken docs (455)
- Add conversions to/from awkward-array to API reference docs (457)
- Fix command to create conda environment in contributor guide docs (462)
- Clarify meaning and usage of monoids in GraphBLAS (469)
- Update copyright to include "and contributors" (470)
- Add support for the following versions of dependencies (464, 478, others):
- `fast_matrix_market` 1.6, 1.7, and 1.8
- `awkward` 2.2 and 2.3
- `numpy` 1.25
- `scipy` 1.11

Maintenance
-----------
- Include conftest.py in MANIFEST.in so sdist can run tests propertly (451)
- Disable linting github action and rely on pre-commit.ci instead (451)

New algorithms (67)
--------------------
- `algorithms.efficiency_measures.efficiency`
- `algorithms.isomorphism.isomorph.fast_could_be_isomorphic`
- `algorithms.isomorphism.isomorph.faster_could_be_isomorphic`
- `algorithms.lowest_common_ancestors.lowest_common_ancestor`
- `algorithms.operators.unary.complement`
- `algorithms.operators.unary.reverse`
- `algorithms.shortest_paths.weighted.bellman_ford_path_length`
- `linalg.bethehessianmatrix.bethe_hessian_matrix`
- `linalg.graphmatrix.adjacency_matrix`
- `linalg.laplacianmatrix.laplacian_matrix`
- `linalg.laplacianmatrix.normalized_laplacian_matrix`
- `linalg.modularitymatrix.directed_modularity_matrix`
- `linalg.modularitymatrix.modularity_matrix`

Enhancements
------------
- Add support for Python 3.11 (61)
- Add logo and benchmarks to README (60)

New algorithms (51, 61, 62, 64)
-----------------------------------
- Components
- is_connected
- is_weakly_connected
- node_connected_component
- Generators
- ego_graph
- Link Analysis
- google_matrix
- Operators
- compose
- difference
- disjoint_union
- full_join
- intersection
- symmetric_difference
- union
- Shortest Paths
- all_pairs_shortest_path_length
- bellman_ford_path
- floyd_warshall_numpy
- negative_edge_cycle
- single_source_shortest_path_length
- single_target_shortest_path_length
- Traversal
- bfs_layers
- descendants_at_distance

Deprecations
------------
- Deprecate `graphblas.core.agg` namespace (420)
- Use `graphblas.core.operator.agg` namespace instead
- Will be removed in version 2023.11.0 or later

Enhancements
------------
- Read Matrix Market files much faster with `fast_matrix_market` (new optional dependency) (391)
- Add Python version badges and description of optional dependencies in README.md (404)
- Split API references into separate pages for better navigation experience (413)

Bug fixes
---------
- Improve import times (which regressed in version 2023.2.0) (419)
- Fix html repr of infix expressions (418)
- Fix broken link in documentation (fundamentals.rst) (397)
- Fix logo in our docs and pin documentation dependency versions (400)
- Fix documentation website rendering issue with right panel (413)

Maintenance
-----------
- Split operator.py into multiple files (420)
- Test with `python-suitesparse-graphblas` wheels on all OSes in CI (385)
- Add SultanOrazbayev as a maintainer (404)
- Misc. maintenance (399, 405, 417)

**_PSA: [`suitesparse-graphblas`](https://pypi.org/project/suitesparse-graphblas/) v7.4.3.2 now has wheels for Windows, MacOS, and Linux :tada:_**

_Note: this is a re-release of 2023.2.0, because 2023.2.0 didn't build and upload to PyPI_

- Add scripts to run benchmarks and download data (39)
- Add `floyd_warshall` algorithm for all-pairs shortest path (42)
- Add `floyd_warshall_predecessor_and_distance` (43)
- Add `all_pairs_bellman_ford_path_length` and `single_source_bellman_ford_path_length` (44)
- Add `NodeNodeMap` class and `matrix_to_nodenodemap` and `matrix_to_vectornodemap` methods (43)
- These can replace `matrix_to_dicts`
- Add `fill_value` to `NodeMap` (43)
- Allow `NodeMap` values to be interpreted as keys (43)
- Add more cached properties (44)
- `min_diagonal` (and other `{monoid_name}_diagonal`)
- `has_negative_diagonal`
- `has_negative_edges-` and `has_negative_edges+`
- `is_iso`
- `iso_value`
- Add `normalize_chunksize` and `partition` utility functions to help run algorithms chunkwise (47)
- Misc. maintenance (41, 45, 46)