From cb171b125c047de75cd2c7c6837e8781b8336699 Mon Sep 17 00:00:00 2001
From: hbui <hong-phuc.bui@htwsaar.de>
Date: Fri, 19 Jul 2024 02:05:08 +0200
Subject: [PATCH] Graph Implementierung für die Aufgabe OK
---
stundenplan/src/pygraph/graphdemo.py | 3 +--
1 files changed, 1 insertions(+), 2 deletions(-)
diff --git a/stundenplan/src/pygraph/graphdemo.py b/stundenplan/src/pygraph/graphdemo.py
index 28bf931..4b999e8 100644
--- a/stundenplan/src/pygraph/graphdemo.py
+++ b/stundenplan/src/pygraph/graphdemo.py
@@ -8,7 +8,6 @@
if not isinstance(vertex, int):
raise TypeError(f"Argument {vertex} is not a valid vertex")
self._adjacent[vertex] = set()
-
pass
def add_edge(self, u, v):
@@ -64,7 +63,7 @@
visited_edges: dict[int, set] = {}
for start in self.vertices():
for end in self.adjacent_of(start):
- (first, second) = (start, end) if (start > end) else (end, start)
+ (first, second) = (start, end) if (start >= end) else (end, start)
if first in visited_edges:
visited_adjacent = visited_edges.get(first)
if second not in visited_adjacent:
--
Gitblit v1.10.0-SNAPSHOT