Skip to content
Snippets Groups Projects
Commit 0235c20d authored by AndiMajore's avatar AndiMajore
Browse files

removed prints

parent 332e23fc
No related branches found
No related tags found
No related merge requests found
.git
...@@ -5,6 +5,6 @@ python3 manage.py migrate ...@@ -5,6 +5,6 @@ python3 manage.py migrate
python3 manage.py createfixtures python3 manage.py createfixtures
python3 manage.py cleanuptasks python3 manage.py cleanuptasks
#python3 manage.py populate_db --update -a #python3 manage.py populate_db --update -a
python3 manage.py make_graphs #python3 manage.py make_graphs
/usr/bin/supervisord -c "/etc/supervisor/conf.d/supervisord.conf" /usr/bin/supervisord -c "/etc/supervisor/conf.d/supervisord.conf"
...@@ -4,16 +4,12 @@ __time = 0 ...@@ -4,16 +4,12 @@ __time = 0
def __dfs_find_bridges(g, node, visited, disc, low, parent, is_bridge): def __dfs_find_bridges(g, node, visited, disc, low, parent, is_bridge):
print("Dfs_find_bridges")
visited[node] = True visited[node] = True
global __time global __time
disc[node] = __time disc[node] = __time
low[node] = __time low[node] = __time
__time += 1 __time += 1
print(f"Checking neighbors of {g.vertex(node)}")
print(f"Degree = {g.vertex(node).out_degree()}")
for nb in g.get_all_neighbors(node): for nb in g.get_all_neighbors(node):
if not visited[nb]: if not visited[nb]:
parent[nb] = node parent[nb] = node
...@@ -26,7 +22,6 @@ def __dfs_find_bridges(g, node, visited, disc, low, parent, is_bridge): ...@@ -26,7 +22,6 @@ def __dfs_find_bridges(g, node, visited, disc, low, parent, is_bridge):
def find_bridges(g): def find_bridges(g):
r"""Finds all bridges in a graph.""" r"""Finds all bridges in a graph."""
print("Finding bridges")
global __time global __time
__time = 0 __time = 0
sys.setrecursionlimit(g.num_vertices() + 1) sys.setrecursionlimit(g.num_vertices() + 1)
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment