Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Update to scikit-network >=0.31 #13

Closed
cmutel opened this issue Sep 25, 2023 · 1 comment
Closed

Update to scikit-network >=0.31 #13

cmutel opened this issue Sep 25, 2023 · 1 comment

Comments

@cmutel
Copy link
Member

cmutel commented Sep 25, 2023

scikit-network 0.31 changed the call signature for get_shortest_path from:

def get_shortest_path(
    adjacency: sparse.csr_matrix, 
    sources: Union[int, Iterable], 
    targets: Union[int, Iterable],
    method: str = 'D', 
    unweighted: bool = False, 
    n_jobs: Optional[int] = None
):

to

def get_shortest_path(
    input_matrix: sparse.csr_matrix, 
    source: Optional[Union[int, Iterable]] = None,
    source_row: Optional[Union[int, Iterable]] = None,
    source_col: Optional[Union[int, Iterable]] = None, 
    force_bipartite: bool = False
):

We need to test this new function, and decide how to support the latest versions.

@cmutel
Copy link
Member Author

cmutel commented Oct 13, 2023

Fixed in 12d2544

@cmutel cmutel closed this as completed Oct 13, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant