mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-01-18 08:17:01 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fix sphinx/build_docs warnings for graphs/check_bipatrite (#12469)

Browse Source 
* Fix sphinx/build_docs warnings for graphs/check_bipatrite

* Fix
This commit is contained in:
Maxim Smolskiy 2024-12-24 11:48:37 +03:00 committed by GitHub
parent e9721aad59
commit c36aaf0fbc
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 14 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

24
graphs/check_bipatrite.py
View File

@ -6,16 +6,17 @@ def is_bipartite_dfs(graph: defaultdict[int, list[int]]) -> bool:
Check if a graph is bipartite using depth-first search (DFS). Check if a graph is bipartite using depth-first search (DFS).
Args: Args:
graph: Adjacency list representing the graph. `graph`: Adjacency list representing the graph.
Returns: Returns:
True if bipartite, False otherwise. ``True`` if bipartite, ``False`` otherwise.
Checks if the graph can be divided into two sets of vertices, such that no two Checks if the graph can be divided into two sets of vertices, such that no two
vertices within the same set are connected by an edge. vertices within the same set are connected by an edge.
Examples: Examples:
# FIXME: This test should pass.
>>> # FIXME: This test should pass.
>>> is_bipartite_dfs(defaultdict(list, {0: [1, 2], 1: [0, 3], 2: [0, 4]})) >>> is_bipartite_dfs(defaultdict(list, {0: [1, 2], 1: [0, 3], 2: [0, 4]}))
Traceback (most recent call last): Traceback (most recent call last):
... ...
@ -37,7 +38,7 @@ def is_bipartite_dfs(graph: defaultdict[int, list[int]]) -> bool:
... ...
KeyError: 0 KeyError: 0
# FIXME: This test should fails with KeyError: 4. >>> # FIXME: This test should fails with KeyError: 4.
>>> is_bipartite_dfs({0: [1, 3], 1: [0, 2], 2: [1, 3], 3: [0, 2], 9: [0]}) >>> is_bipartite_dfs({0: [1, 3], 1: [0, 2], 2: [1, 3], 3: [0, 2], 9: [0]})
False False
>>> is_bipartite_dfs({0: [-1, 3], 1: [0, -2]}) >>> is_bipartite_dfs({0: [-1, 3], 1: [0, -2]})
@ -51,7 +52,8 @@ def is_bipartite_dfs(graph: defaultdict[int, list[int]]) -> bool:
... ...
KeyError: 0 KeyError: 0
# FIXME: This test should fails with TypeError: list indices must be integers or... >>> # FIXME: This test should fails with
>>> # TypeError: list indices must be integers or...
>>> is_bipartite_dfs({0: [1.0, 3.0], 1.0: [0, 2.0], 2.0: [1.0, 3.0], 3.0: [0, 2.0]}) >>> is_bipartite_dfs({0: [1.0, 3.0], 1.0: [0, 2.0], 2.0: [1.0, 3.0], 3.0: [0, 2.0]})
True True
>>> is_bipartite_dfs({"a": [1, 3], "b": [0, 2], "c": [1, 3], "d": [0, 2]}) >>> is_bipartite_dfs({"a": [1, 3], "b": [0, 2], "c": [1, 3], "d": [0, 2]})
@ -95,16 +97,17 @@ def is_bipartite_bfs(graph: defaultdict[int, list[int]]) -> bool:
Check if a graph is bipartite using a breadth-first search (BFS). Check if a graph is bipartite using a breadth-first search (BFS).
Args: Args:
graph: Adjacency list representing the graph. `graph`: Adjacency list representing the graph.
Returns: Returns:
True if bipartite, False otherwise. ``True`` if bipartite, ``False`` otherwise.
Check if the graph can be divided into two sets of vertices, such that no two Check if the graph can be divided into two sets of vertices, such that no two
vertices within the same set are connected by an edge. vertices within the same set are connected by an edge.
Examples: Examples:
# FIXME: This test should pass.
>>> # FIXME: This test should pass.
>>> is_bipartite_bfs(defaultdict(list, {0: [1, 2], 1: [0, 3], 2: [0, 4]})) >>> is_bipartite_bfs(defaultdict(list, {0: [1, 2], 1: [0, 3], 2: [0, 4]}))
Traceback (most recent call last): Traceback (most recent call last):
... ...
@ -126,7 +129,7 @@ def is_bipartite_bfs(graph: defaultdict[int, list[int]]) -> bool:
... ...
KeyError: 0 KeyError: 0
# FIXME: This test should fails with KeyError: 4. >>> # FIXME: This test should fails with KeyError: 4.
>>> is_bipartite_bfs({0: [1, 3], 1: [0, 2], 2: [1, 3], 3: [0, 2], 9: [0]}) >>> is_bipartite_bfs({0: [1, 3], 1: [0, 2], 2: [1, 3], 3: [0, 2], 9: [0]})
False False
>>> is_bipartite_bfs({0: [-1, 3], 1: [0, -2]}) >>> is_bipartite_bfs({0: [-1, 3], 1: [0, -2]})
@ -140,7 +143,8 @@ def is_bipartite_bfs(graph: defaultdict[int, list[int]]) -> bool:
... ...
KeyError: 0 KeyError: 0
# FIXME: This test should fails with TypeError: list indices must be integers or... >>> # FIXME: This test should fails with
>>> # TypeError: list indices must be integers or...
>>> is_bipartite_bfs({0: [1.0, 3.0], 1.0: [0, 2.0], 2.0: [1.0, 3.0], 3.0: [0, 2.0]}) >>> is_bipartite_bfs({0: [1.0, 3.0], 1.0: [0, 2.0], 2.0: [1.0, 3.0], 3.0: [0, 2.0]})
True True
>>> is_bipartite_bfs({"a": [1, 3], "b": [0, 2], "c": [1, 3], "d": [0, 2]}) >>> is_bipartite_bfs({"a": [1, 3], "b": [0, 2], "c": [1, 3], "d": [0, 2]})