8000 Use Mapping for graph_dict · python/typeshed@5181e7f · GitHub
[go: up one dir, main page]
Skip to content

Commit 5181e7f

Browse files
lkctlkct
committed
Use Mapping for graph_dict
1 parent 2e1d08e commit 5181e7f

File tree

1 file changed

+3
-3
lines changed

1 file changed

+3
-3
lines changed

‎stubs/networkx/networkx/algorithms/approximation/treewidth.pyi‎

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,5 @@
11
from _typeshed import Incomplete
2-
from collections.abc import Callable
2+
from collections.abc import Callable, Mapping
33
from typing import Generic
44

55
from networkx.classes.graph import Graph, _Node
@@ -16,9 +16,9 @@ class MinDegreeHeuristic(Generic[_Node]):
1616
count: Incomplete
1717

1818
def __init__(self, graph: Graph[_Node]) -> None: ...
19-
def best_node(self, graph: dict[_Node, set[_Node]]) -> _Node | None: ...
19+
def best_node(self, graph: Mapping[_Node, set[_Node]]) -> _Node | None: ...
2020

21-
def min_fill_in_heuristic(graph_dict: dict[_Node, set[_Node]]) -> _Node | None: ...
21+
def min_fill_in_heuristic(graph_dict: Mapping[_Node, set[_Node]]) -> _Node | None: ...
2222
@_dispatchable
2323
def treewidth_decomp(
2424
G: Graph[_Node], heuristic: Callable[[dict[_Node, set[_Node]]], _Node | None] = ...

0 commit comments

Comments
 (0)
0