diff --git a/alib2algo/test-src/graph/shortestpath/BellmanFordTest.cpp b/alib2algo/test-src/graph/shortestpath/BellmanFordTest.cpp
index cfb2a04f2c2ee2cd86490b00a23c2ff13a525011..68614dfe3297f2e14e93eac321089a715eeac709 100644
--- a/alib2algo/test-src/graph/shortestpath/BellmanFordTest.cpp
+++ b/alib2algo/test-src/graph/shortestpath/BellmanFordTest.cpp
@@ -129,6 +129,9 @@ void GraphBellmanFordTest::testMultiEdge()
 
 	res = graph::shortestpath::BellmanFord::bellmanford(dg, n1);
 
+	std::cout << res << std::endl;
+	std::cout << dg.getEdges() << std::endl;
+
 	CPPUNIT_ASSERT_EQUAL(0, res[n1]);
 	CPPUNIT_ASSERT_EQUAL(1, res[n2]);
 	CPPUNIT_ASSERT_EQUAL(2, res[n3]);
diff --git a/alib2data/src/graph/directed/DirectedEdge.cpp b/alib2data/src/graph/directed/DirectedEdge.cpp
index 027830cb9794ae45e7abd4fa476a65d6287a0687..e80f06391c10f3bed0055cd40fbaacaa23619754 100644
--- a/alib2data/src/graph/directed/DirectedEdge.cpp
+++ b/alib2data/src/graph/directed/DirectedEdge.cpp
@@ -152,7 +152,7 @@ std::ostream &operator<<(std::ostream &out, const DirectedEdge &node)
 
 void DirectedEdge::dump(std::ostream &os) const
 {
-	os << "(DirectedEdge " << from << " -> " << to << ")";
+	os << "(DirectedEdge " << from << " -> ( " << name << " ) " << to << ")";
 }
 
 } // namespace graph
diff --git a/alib2data/src/graph/undirected/UndirectedEdge.cpp b/alib2data/src/graph/undirected/UndirectedEdge.cpp
index 3ea39761111b3da2697d41c6171fdd92a0770348..a0dc659196b0eeab20b03e0a0a99a2b8781146aa 100644
--- a/alib2data/src/graph/undirected/UndirectedEdge.cpp
+++ b/alib2data/src/graph/undirected/UndirectedEdge.cpp
@@ -156,7 +156,7 @@ std::ostream &operator<<(std::ostream &out, const UndirectedEdge &node)
 void UndirectedEdge::dump(std::ostream &os) const
 {
 	auto nodes = sortedNodes();
-	os << "(UndirectedEdge " << nodes.first << " -> " << nodes.second << ")";
+	os << "(UndirectedEdge " << nodes.first << " -> ( " << name << " ) " << nodes.second << ")";
 }
 
 std::pair<Node, Node> UndirectedEdge::sortedNodes() const