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_tests.py | 15 +++++++++++++++
1 files changed, 15 insertions(+), 0 deletions(-)
diff --git a/stundenplan/src/graphdemo_tests.py b/stundenplan/src/graphdemo_tests.py
index cd6234c..0744753 100644
--- a/stundenplan/src/graphdemo_tests.py
+++ b/stundenplan/src/graphdemo_tests.py
@@ -29,11 +29,14 @@
edges = [
"1-2", "1-3", "2-3", "2-4"
]
+ edge_count = []
def action(a, b):
(s,e) = (a,b) if a < b else (b,a)
edge = f"{s}-{e}"
+ edge_count.append(edge)
self.assertTrue(edge in edges)
g.for_each_edges(action)
+ self.assertEqual(len(edge_count), len(edges))
def test_iterate_all_vertices(self):
g = Graph()
@@ -48,6 +51,18 @@
self.assertListEqual(sorted(vertices), expected)
pass
+ def test_iterate_all_vertices_lambda(self):
+ g = Graph()
+ g.add_edge(1, 2)
+ g.add_edge(1, 3)
+ g.add_edge(2, 3)
+ g.add_edge(2, 4)
+ vertices = []
+ g.for_each_vertices(lambda v : print(f"visit {v}"))
+ print(vertices)
+ pass
+
+
def test_iterate_neighbor_vertex(self):
g = Graph()
g.add_edge(1, 2)
--
Gitblit v1.10.0