Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
B
backend
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Iterations
Wiki
Requirements
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Locked files
Build
Pipelines
Jobs
Pipeline schedules
Test cases
Artifacts
Deploy
Releases
Package Registry
Container Registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Code review analytics
Issue analytics
Insights
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Terms and privacy
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Cosy-Bio
Drugst.One
backend
Commits
42c4d208
Commit
42c4d208
authored
2 years ago
by
AndiMajore
Browse files
Options
Downloads
Patches
Plain Diff
removed prints
Former-commit-id:
0235c20d
parent
5bd6318e
No related branches found
No related tags found
No related merge requests found
Changes
3
Hide whitespace changes
Inline
Side-by-side
Showing
3 changed files
.dockerignore
+1
-0
1 addition, 0 deletions
.dockerignore
scripts/docker-entrypoint.sh
+1
-1
1 addition, 1 deletion
scripts/docker-entrypoint.sh
tasks/util/find_bridges.py
+0
-5
0 additions, 5 deletions
tasks/util/find_bridges.py
with
2 additions
and
6 deletions
.dockerignore
0 → 100644
+
1
−
0
View file @
42c4d208
.git
This diff is collapsed.
Click to expand it.
scripts/docker-entrypoint.sh
+
1
−
1
View file @
42c4d208
...
...
@@ -5,6 +5,6 @@ python3 manage.py migrate
python3 manage.py createfixtures
python3 manage.py cleanuptasks
#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"
This diff is collapsed.
Click to expand it.
tasks/util/find_bridges.py
+
0
−
5
View file @
42c4d208
...
...
@@ -4,16 +4,12 @@ __time = 0
def
__dfs_find_bridges
(
g
,
node
,
visited
,
disc
,
low
,
parent
,
is_bridge
):
print
(
"
Dfs_find_bridges
"
)
visited
[
node
]
=
True
global
__time
disc
[
node
]
=
__time
low
[
node
]
=
__time
__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
):
if
not
visited
[
nb
]:
parent
[
nb
]
=
node
...
...
@@ -26,7 +22,6 @@ def __dfs_find_bridges(g, node, visited, disc, low, parent, is_bridge):
def
find_bridges
(
g
):
r
"""
Finds all bridges in a graph.
"""
print
(
"
Finding bridges
"
)
global
__time
__time
=
0
sys
.
setrecursionlimit
(
g
.
num_vertices
()
+
1
)
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment