pub fn graph_to_sparse_adjacency<N>(
graph: &Graph<N, i64>,
policy: MultiedgePolicy,
) -> Result<(SparseMatrix<MinPlus>, GraphMatrixMap), GraphError>Expand description
Sparse min-plus weighted adjacency, applying a multiedge policy and omitting self-loops.