isAcyclic [(1,[1,2,4]),(2,[1,3]),(3,[2]),(4,[1,4]),(5,[])] == False
isAcyclic [(1,[2]),(2,[1]),(3,[])] == True

minCosts (WG [(1,[(2,5),(3,2)]),(2,[(1,5),(3,1)]),(3,[(1,2),(2,1)])]) 1 2 == (Mc 3)
minCosts (WG [(1,[(2,5),(3,2)]),(2,[(1,5),(3,1)]),(3,[(1,2),(2,1)]),(4,[])]) 2 4 = (Np "Nicht verbunden")

conv1 [(1,[(2,3)],(2,[(2,7),(1,3)])] == WG [(1,[(2,3)],(2,[(2,7),(1,3)])]
conv2 (WG [(1,[(2,3)])]) == []

xPatternMatching "ab[C]xy" ["abCxy","baKunterbunTov","abxy"] == ["abxy","abCxy"]
xPatternMatching "a?b[[*v)]x]y" ["aCb[*v)x]y","aKbx]y","aZbx]y"] == ["aKbx]y","aZbx]y","aCb[*v)x]y"]