summaryrefslogtreecommitdiff
path: root/networkx/algorithms/tournament.py
diff options
context:
space:
mode:
authorJim Kitchen <jim22k@gmail.com>2022-10-11 15:24:14 -0500
committerMridul Seth <git@mriduls.com>2022-10-12 12:05:14 +0400
commitc2111a36841d5e43b6beae1fd667996d35646e30 (patch)
tree38fa5e1316ca45a9906169ceb7ac21bfc52a612e /networkx/algorithms/tournament.py
parent71434d674cf8ec6c3007dd41b78ee6f407e9b4eb (diff)
downloadnetworkx-nx-sparse.tar.gz
Allow dispatcher decorator without a namenx-sparse
- Name is taken from the decorated function - Raise error if backend doesn't implement a decorated function which is called - Check for duplicate names for dispatching algorithms
Diffstat (limited to 'networkx/algorithms/tournament.py')
-rw-r--r--networkx/algorithms/tournament.py6
1 files changed, 3 insertions, 3 deletions
diff --git a/networkx/algorithms/tournament.py b/networkx/algorithms/tournament.py
index 60d09f31..a57c3592 100644
--- a/networkx/algorithms/tournament.py
+++ b/networkx/algorithms/tournament.py
@@ -61,7 +61,7 @@ def index_satisfying(iterable, condition):
raise ValueError("iterable must be non-empty") from err
-@nx.dispatch("is_tournament")
+@nx.dispatch
@not_implemented_for("undirected")
@not_implemented_for("multigraph")
def is_tournament(G):
@@ -180,7 +180,7 @@ def random_tournament(n, seed=None):
return nx.DiGraph(edges)
-@nx.dispatch("score_sequence")
+@nx.dispatch
@not_implemented_for("undirected")
@not_implemented_for("multigraph")
def score_sequence(G):
@@ -210,7 +210,7 @@ def score_sequence(G):
return sorted(d for v, d in G.out_degree())
-@nx.dispatch("tournament_matrix")
+@nx.dispatch
@not_implemented_for("undirected")
@not_implemented_for("multigraph")
def tournament_matrix(G):