Skip to content

Allow users to customize the generation method of parent nodes #127

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

Merged
merged 2 commits into from
Sep 30, 2024
Merged

Allow users to customize the generation method of parent nodes #127

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
7c5bbc2
Allow users to customize the generation method of parent nodes
weilycoder Sep 30, 2024
2d96d57
fix function note grammar issue
Mr-Python-in-China Sep 30, 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
6 changes: 5 additions & 1 deletion cyaron/graph.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -146,6 +146,9 @@ def tree(point_count, chain=0, flower=0, **kwargs):
int/float weight_gen()
= lambda: random.randint(weight_limit[0], weight_limit[1])
-> the generator of the weights. It should return the weight. The default way is to use the random.randint()
int father_gen(cur)
= lambda cur: random.randrange(1, cur)
-> the generator of the fathers of current point.
"""
directed = kwargs.get("directed", False)
weight_limit = kwargs.get("weight_limit", (1, 1))
Expand All @@ -154,6 +157,7 @@ def tree(point_count, chain=0, flower=0, **kwargs):
weight_gen = kwargs.get(
"weight_gen", lambda: random.randint(
weight_limit[0], weight_limit[1]))
father_gen = kwargs.get("father_gen", lambda cur: random.randrange(1, cur))

if not 0 <= chain <= 1 or not 0 <= flower <= 1:
raise Exception("chain and flower must be between 0 and 1")
Expand All @@ -174,7 +178,7 @@ def tree(point_count, chain=0, flower=0, **kwargs):
for i in range(chain_count + 2, chain_count + flower_count + 2):
graph.add_edge(1, i, weight=weight_gen())
for i in range(point_count - random_count + 1, point_count + 1):
u = random.randrange(1, i)
u = father_gen(i)
graph.add_edge(u, i, weight=weight_gen())

return graph
Expand Down