Skip to content

Timing script for bipartite actually producing bipartite graph #158

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
dschult merged 1 commit into from
Apr 1, 2026
Merged

Timing script for bipartite actually producing bipartite graph #158

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
28 changes: 15 additions & 13 deletions timing/new_heatmaps/timing_individual_function.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -58,19 +58,21 @@ def record_result(stdTime, parallelTime, row, col):
G = nx.bipartite.random_graph(
n[ind], m[ind], p, directed=True, seed=seed
)
for cur_node in G.nodes:
neighbors = set(G.neighbors(cur_node))
# have atleast 2 outgoing edges
while len(neighbors) < 2:
new_neighbor = seed.choice(
[
node
for node in G.nodes
if node != cur_node and node not in neighbors
]
)
G.add_edge(cur_node, new_neighbor)
neighbors.add(new_neighbor)
A, B = range(n[ind]), range(n[ind], n[ind] + m[ind])
for source_group, target_group in [(A, B), (B, A)]:
for cur_node in source_group:
neighbors = set(G.neighbors(cur_node))
# have atleast 2 outgoing edges
while len(neighbors) < 2:
new_neighbor = seed.choice(
[
node
for node in target_group
if node not in neighbors
]
)
G.add_edge(cur_node, new_neighbor)
neighbors.add(new_neighbor)
else:
print(f"Number of Nodes: {num}")
G = nx.fast_gnp_random_graph(
Expand Down
Loading