From 9309589ff6fe3f61abd61263f61eb890141f6491 Mon Sep 17 00:00:00 2001
From: Hong-Phuc Bui <hong-phuc.bui@htwsaar.de>
Date: Tue, 24 Jun 2025 16:18:56 +0200
Subject: [PATCH] fix iteration over edges
---
stundenplan/src/graphdemo.py | 22 ++++++++++------------
1 files changed, 10 insertions(+), 12 deletions(-)
diff --git a/stundenplan/src/graphdemo.py b/stundenplan/src/graphdemo.py
index d8669be..9b0ac22 100644
--- a/stundenplan/src/graphdemo.py
+++ b/stundenplan/src/graphdemo.py
@@ -89,19 +89,17 @@
for start in sorted( self.vertices() ):
for end in self.adjacent_of(start):
(first, second) = (start, end) if (start >= end) else (end, start)
- if first in visited_edges:
- #visited_adjacent = visited_edges.get(first)
- visited_adjacent = visited_edges[first]
- if second not in visited_adjacent:
- visited_adjacent.add(second)
+ if first in visited_edges:
+ #visited_adjacent = visited_edges.get(first)
+ visited_adjacent = visited_edges[first]
+ if second not in visited_adjacent:
+ visited_adjacent.add(second)
+ action(start, end)
+ else:
+ adjacent: set[int] = set()
+ visited_edges[first] = adjacent
+ adjacent.add(second)
action(start, end)
- else:
- adjacent: set[int] = set()
- visited_edges[first] = adjacent
- adjacent.add(second)
- action(start, end)
-
-
def __repr__(self):
text = ""
--
Gitblit v1.10.0