Améliorations / Corrections

Vous avez des améliorations (ou des corrections) à proposer pour ce document : je vous remerçie par avance de m'en faire part, cela m'aide à améliorer le site.

Emplacement :

Description des améliorations :

Liste des exceptions du module scipy.sparse.csgraph

Nom de la classe d'exception	Description
NegativeCycleError

NegativeCycleError

Signature de la fonction	Description
bellman_ford(csgraph, directed=True, indices=None, return_predecessors=False, unweighted=False)
breadth_first_order(csgraph, i_start, directed=True, return_predecessors=True)
breadth_first_tree(csgraph, i_start, directed=True)
connected_components(csgraph, directed=True, connection='weak', return_labels=True)
construct_dist_matrix(graph, predecessors, directed=True, null_value=inf)
csgraph_from_dense(graph, null_value=0, nan_null=True, infinity_null=True)
csgraph_from_masked(graph)
csgraph_masked_from_dense(graph, null_value=0, nan_null=True, infinity_null=True, copy=True)
csgraph_to_dense(csgraph, null_value=0)
csgraph_to_masked(csgraph)
depth_first_order(csgraph, i_start, directed=True, return_predecessors=True)
depth_first_tree(csgraph, i_start, directed=True)
dijkstra(csgraph, directed=True, indices=None, return_predecessors=False, unweighted=False, limit=inf, min_only=False)
floyd_warshall(csgraph, directed=True, return_predecessors=False, unweighted=False, overwrite=False)
johnson(csgraph, directed=True, indices=None, return_predecessors=False, unweighted=False)
laplacian(csgraph, normed=False, return_diag=False, use_out_degree=False, *, copy=True, form='array', dtype=None, symmetrized=False)
maximum_bipartite_matching(graph, perm_type='row')
maximum_flow(csgraph, source, sink, *, method='dinic')
min_weight_full_bipartite_matching(biadjacency, maximize=False)
minimum_spanning_tree(csgraph, overwrite=False)
reconstruct_path(csgraph, predecessors, directed=True)
reverse_cuthill_mckee(graph, symmetric_mode=False)
shortest_path(csgraph, method='auto', directed=True, return_predecessors=False, unweighted=False, overwrite=False, indices=None)
structural_rank(graph)
test(label='fast', verbose=1, extra_argv=None, doctests=False, coverage=False, tests=None, parallel=None)
yen(csgraph, source, sink, K, *, directed=True, return_predecessors=False, unweighted=False)

bellman_ford(csgraph, directed=True, indices=None, return_predecessors=False, unweighted=False)

breadth_first_order(csgraph, i_start, directed=True, return_predecessors=True)

breadth_first_tree(csgraph, i_start, directed=True)

connected_components(csgraph, directed=True, connection='weak', return_labels=True)

construct_dist_matrix(graph, predecessors, directed=True, null_value=inf)

csgraph_from_dense(graph, null_value=0, nan_null=True, infinity_null=True)

csgraph_from_masked(graph)

csgraph_masked_from_dense(graph, null_value=0, nan_null=True, infinity_null=True, copy=True)

csgraph_to_dense(csgraph, null_value=0)

csgraph_to_masked(csgraph)

depth_first_order(csgraph, i_start, directed=True, return_predecessors=True)

depth_first_tree(csgraph, i_start, directed=True)