Skip to content

Updated topological_sort.py #11281

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.

Sign up for GitHub

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

Closed
wants to merge 10 commits into from
Closed

Updated topological_sort.py #11281

Changes from all commits
Commits
Show all changes
10 commits
Select commit Hold shift + click to select a range
9b7e9e1
Update topological_sort.py
ShengLiuDev Feb 12, 2024
fe22fb2
[pre-commit.ci] auto fixes from pre-commit.com hooks
pre-commit-ci[bot] Feb 12, 2024
ad74538
Update topological_sort.py
ShengLiuDev Feb 12, 2024
2d1622f
Merge branch 'master' of https://github.com/ShengLiuDev/TheAlgorithms…
ShengLiuDev Feb 12, 2024
0a8383b
[pre-commit.ci] auto fixes from pre-commit.com hooks
pre-commit-ci[bot] Feb 12, 2024
fecee82
Update topological_sort.py
ShengLiuDev Feb 12, 2024
047ddd2
Merge branch 'master' of https://github.com/ShengLiuDev/TheAlgorithms…
ShengLiuDev Feb 12, 2024
029c12f
[pre-commit.ci] auto fixes from pre-commit.com hooks
pre-commit-ci[bot] Feb 12, 2024
96232dd
Fixed Camel Casing
ShengLiuDev Feb 12, 2024
aace5a0
Merge branch 'master' of https://github.com/ShengLiuDev/TheAlgorithms…
ShengLiuDev Feb 12, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
260 changes: 245 additions & 15 deletions sorts/topological_sort.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,18 +1,244 @@
"""Topological Sort."""
from typing import Any, Dict, List

# a
# / \
# b c
# / \
# d e
edges: dict[str, list[str]] = {
"a": ["c", "b"],
"b": ["d", "e"],
"c": [],
"d": [],
"e": [],
}
vertices: list[str] = ["a", "b", "c", "d", "e"]
test_cases: List[Dict[str, Any]] = [
{
# a
# / \
# b c
# / \
# d e
"edges": {
"a": ["c", "b"],
"b": ["d", "e"],
"c": [],
"d": [],
"e": [],
},
"vertices": ["a", "b", "c", "d", "e"],
},
{
# a
# / | \
# b c f
# / \ / \
# d e g h
# /
# i
"edges": {
"a": ["b", "c", "f"],
"b": ["d", "e"],
"c": [],
"d": [],
"e": [],
"f": ["g", "h"],
"g": ["i"],
"h": [],
"i": [],
},
"vertices": ["a", "b", "c", "d", "e", "f", "g", "h", "i"],
},
{
# a
# / \
# b c
# / / \
# d e f
# /
# g
# /
# h
# /
# i
# /
# j
# /
# k
"edges": {
"a": ["b", "c"],
"b": ["d"],
"c": ["e", "f"],
"d": ["g"],
"e": [],
"f": [],
"g": ["h"],
"h": ["i"],
"i": ["j"],
"j": ["k"],
"k": [],
},
"vertices": ["a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k"],
},
{
#
# a
# / \
# b c
# / \ / \
# d e f g
"edges": {
"a": ["b", "c"],
"b": ["d", "e"],
"c": ["f", "g"],
"d": [],
"e": [],
"f": [],
"g": [],
},
"vertices": ["a", "b", "c", "d", "e", "f", "g"],
},
{
#
# a
# / \
# b c
# / \ / \
# d e f g
# / \ \ \
# h i j k
# / \
# l m
# /
# n
#
#
"edges": {
"a": ["b", "c"],
"b": ["d", "e"],
"c": ["f", "g"],
"d": ["h", "i"],
"e": ["j"],
"f": [],
"g": ["k"],
"h": ["l"],
"i": ["m"],
"j": [],
"k": [],
"l": ["n"],
"m": [],
"n": [],
},
"vertices": ["a", "b", "c", "d", "e", "f", "g"],
},
{
# a
# /
# b
# /
# c
# /
# d
# /
# e
# /
# f
# /
# g
# /
# h
"edges": {
"a": ["b"],
"b": ["c"],
"c": ["d"],
"d": ["e"],
"e": ["f"],
"f": ["g"],
"g": ["h"],
"h": [],
},
"vertices": ["a", "b", "c", "d", "e", "f", "g", "h"],
},
{
# a
# / | \
# b c d
# / \
# e f
# / \
# g h
# / \
# i j
# / \
# k l
"edges": {
"a": ["b", "c", "d"],
"b": ["e"],
"c": [],
"d": ["f"],
"e": ["g"],
"f": ["h"],
"g": ["i"],
"h": ["j"],
"i": ["k"],
"j": ["l"],
"k": [],
"l": [],
},
"vertices": ["a", "b", "c", "d", "e", "f", "g", "h", "i"],
},
{
# a
# / \
# b c
# / \
# d e
"edges": {
"a": ["b", "c"],
"b": ["d"],
"c": ["e"],
"d": [],
"e": [],
},
"vertices": ["a", "b", "c", "d", "e"],
},
{
# a h
# / \ \
# b c i
# | | |
# d e j
# | |
# g f
"edges": {
"a": ["b", "c"],
"b": ["d"],
"c": ["e", "f"],
"d": ["g"],
"e": [],
"f": [],
"g": [],
"h": ["i"],
"i": ["j"],
"j": [],
},
"vertices": ["a", "b", "c", "d", "e", "f", "g", "h", "i", "j"],
},
{
# a h k
# / \ \ \
# b c i l
# | | | |
# d e j m
# | |
# g f
"edges": {
"a": ["b", "c"],
"b": ["d"],
"c": ["e"],
"d": ["g"],
"e": ["f"],
"f": [],
"g": [],
"h": ["i"],
"i": ["j"],
"j": [],
"k": ["l"],
"l": ["m"],
"m": [],
},
"vertices": ["a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m"],
},
]


def topological_sort(start: str, visited: list[str], sort: list[str]) -> list[str]:
Expand All @@ -37,5 +263,9 @@ def topological_sort(start: str, visited: list[str], sort: list[str]) -> list[st


if __name__ == "__main__":
sort = topological_sort("a", [], [])
print(sort)
for idx, test_case in enumerate(test_cases, start=1):
print(f"Test Case {idx}:")
edges = test_case["edges"]
vertices = test_case["vertices"]
sort = topological_sort("a", [], [])
print(sort)