def test_graph_BFS(self) -> None:
graph = Graph()
Node_0 = Node(0)
Node_1 = Node(1)
Node_2 = Node(2)
Node_3 = Node(3)
graph.add_directed_edge(Node_0, Node_1)
graph.add_directed_edge(Node_0, Node_2)
graph.add_directed_edge(Node_1, Node_2)
graph.add_directed_edge(Node_2, Node_0)
graph.add_directed_edge(Node_2, Node_3)
graph.add_directed_edge(Node_3, Node_3)
graph.BFS(Node_2)
def main():
graph = Graph() # Instantiate your graph
graph.add_vertex('0')
graph.add_vertex('1')
graph.add_vertex('2')
graph.add_vertex('3')
graph.add_edge('0', '1')
graph.add_edge('0', '3')
print(graph.vertices)
print(graph.BFT("0"))
print(graph.DFT("0"))
print(graph.DFTR("0"))
print(graph.BFS("0", "1"))
print(graph.DFS("0", "1"))
def main():
g = Graph({0: [(2, 1), (1, 10)], 1: [(0, 1)], 2: [(2, 1), (1, 1)]})
h = Graph({
0: [(1, 2), (8, 866)],
1: [(0, 3), (2, 1)],
2: [(3, 4), (4, 1), (5, 2), (8, 1)],
3: [(2, 2)],
4: [(2, 1), (7, 3)],
5: [(2, 3), (6, 2), (4, 1)],
6: [(8, 1), (5, 1)],
7: [(6, 4), (4, 4)],
8: [(0, 4), (2, 1), (6, 6)]
})
print("DFS: %s" % str(h.DFS(0, 7)))
print("BFS: %s" % str(h.BFS(0, 7)))
print("Dikstra: %s" % str(h.dikstra(0, 7)))
print("Heuristics: %s" % h.h(7))
print("Astar: %s" % str(h.astar(0, 7, h.h(7))))
def test_bfs(self):
graph = Graph()
graph.add_vertex('0')
graph.add_vertex('1')
graph.add_vertex('2')
graph.add_vertex('9')
graph.add_edge('0', '1')
graph.add_edge('0', '2')
graph.add_edge('1', '2')
graph.add_edge('2', '0')
graph.add_edge('2', '9')
assert graph.BFS('2', 1) == ['2', '0', '1', '9']
# Should raise ValueError because vertex doesn't exist
self.assertRaises(ValueError, graph.BFS, 'Rainbow Unicorn', 1)
# Should raise ValueError because traversing negative depth
self.assertRaises(ValueError, graph.BFS, '2', -1)
def test013_DFS2_BFS2_xDFS2_xDFS2_aview2_wview2():
g = Graph()
g.addClique("abcdefg", w=0)
assert g.short(
) == "a>b,c,d,e,f,g b>a,c,d,e,f,g c>a,b,d,e,f,g d>a,b,c,e,f,g e>a,b,c,d,f,g f>a,b,c,d,e,g g>a,b,c,d,e,f"
assert g.short(
out=False
) == "a<b,c,d,e,f,g b<a,c,d,e,f,g c<a,b,d,e,f,g d<a,b,c,e,f,g e<a,b,c,d,f,g f<a,b,c,d,e,g g<a,b,c,d,e,f"
a = """\
Adjacency matrix (1=arc present, 2=self loop, "." or 0=absent):
a b c d e f g
a: | . 1 1 1 1 1 1 |
b: | 1 . 1 1 1 1 1 |
c: | 1 1 . 1 1 1 1 |
d: | 1 1 1 . 1 1 1 |
e: | 1 1 1 1 . 1 1 |
f: | 1 1 1 1 1 . 1 |
g: | 1 1 1 1 1 1 . |"""
assert g.aview() == a
w = """\
Adjacency Matrix of weights (values = arc weights, "." = absent arc):
a b c d e f g
a: | . 0 0 0 0 0 0 |
b: | 0 . 0 0 0 0 0 |
c: | 0 0 . 0 0 0 0 |
d: | 0 0 0 . 0 0 0 |
e: | 0 0 0 0 . 0 0 |
f: | 0 0 0 0 0 . 0 |
g: | 0 0 0 0 0 0 . |"""
assert g.wview() == w
assert g.DFS("a", sort=True) == ['a', 'b', 'c', 'd', 'e', 'f', 'g']
assert g.DFS("b", sort=True) == ['b', 'a', 'c', 'd', 'e', 'f', 'g']
assert g.BFS("a", sort=True) == ['a', 'b', 'c', 'd', 'e', 'f', 'g']
assert g.BFS("b", sort=True) == ['b', 'a', 'c', 'd', 'e', 'f', 'g']
assert list(g.xDFS("a", sort=True)) == ['a', 'b', 'c', 'd', 'e', 'f', 'g']
assert list(g.xDFS("b", sort=True)) == ['b', 'a', 'c', 'd', 'e', 'f', 'g']
assert list(g.xBFS("a", sort=True)) == ['a', 'b', 'c', 'd', 'e', 'f', 'g']
assert list(g.xBFS("b", sort=True)) == ['b', 'a', 'c', 'd', 'e', 'f', 'g']
def test014_DFS3_BFS3_xDFS3_xDFS3_aview3_wview3_addPath1():
g = Graph()
g.addPath("abcdefg", w=0)
assert g.short() == "a>b b>c c>d d>e e>f f>g g"
assert g.short(out=False) == "a b<a c<b d<c e<d f<e g<f"
a = """\
Adjacency matrix (1=arc present, 2=self loop, "." or 0=absent):
a b c d e f g
a: | . 1 . . . . . |
b: | . . 1 . . . . |
c: | . . . 1 . . . |
d: | . . . . 1 . . |
e: | . . . . . 1 . |
f: | . . . . . . 1 |
g: | . . . . . . . |"""
assert g.aview() == a
w = """\
Adjacency Matrix of weights (values = arc weights, "." = absent arc):
a b c d e f g
a: | . 0 . . . . . |
b: | . . 0 . . . . |
c: | . . . 0 . . . |
d: | . . . . 0 . . |
e: | . . . . . 0 . |
f: | . . . . . . 0 |
g: | . . . . . . . |"""
assert g.wview() == w
assert g.DFS("a", sort=True) == ['a', 'b', 'c', 'd', 'e', 'f', 'g']
assert g.DFS("b", sort=True) == ['b', 'c', 'd', 'e', 'f', 'g']
assert g.BFS("a", sort=True) == ['a', 'b', 'c', 'd', 'e', 'f', 'g']
assert g.BFS("b", sort=True) == ['b', 'c', 'd', 'e', 'f', 'g']
assert list(g.xDFS("a", sort=True)) == ['a', 'b', 'c', 'd', 'e', 'f', 'g']
assert list(g.xDFS("b", sort=True)) == ['b', 'c', 'd', 'e', 'f', 'g']
assert list(g.xBFS("a", sort=True)) == ['a', 'b', 'c', 'd', 'e', 'f', 'g']
assert list(g.xBFS("b", sort=True)) == ['b', 'c', 'd', 'e', 'f', 'g']
from graph import Graph
graph = {
'A': ['B', 'E', 'H'],
'B': ['C', 'D'],
'E': ['F', 'G'],
'H': ['G', 'I'],
'C': [],
'D': [],
'F': [],
'I': [],
'G': []
}
if __name__ == '__main__':
g = Graph()
g.set_graph(graph)
g.print_graph()
print("Visited Nodes :", g.BFS('A', 'F'))
print("path to goal :", g.path_to_goal('A', 'F'))
def main():
g = Graph({0: [(2, 1), (1, 10)], 1: [(0, 1)], 2: [(2, 1), (1, 1)]})
print("DFS: %s" % str(g.DFS(0, 1)))
print("BFS: %s" % str(g.BFS(0, 1)))
print("Dijkstra: %s" % str(g.dijkstra(0, 1)))
print("A*: %s" % str(g.astar(0, 1)))
v[1].set_adj([v[0], v[2]])
v[2].set_adj([v[1], v[3]])
v[3].set_adj([v[2], v[4], v[7]])
v[4].set_adj([v[3], v[7], v[5], v[6]])
v[5].set_adj([v[4], v[6]])
v[6].set_adj([v[4], v[5], v[7]])
v[7].set_adj([v[3], v[4], v[6]])
for vtx in v:
gb.insert(vtx)
for u in gb.v:
u.print_adj()
print()
gb.BFS(gb.v[2])
print(f"Putanja od {gb.v[2]} do {gb.v[5]}:")
gb.print_path(gb.v[2], gb.v[5])
print("\n")
# ------------------------ Zadatak 3 ------------------------
print("Zadatak 3\n")
gd = Graph()
v = []
for i in range(0, 6):
v.append(Vertex(Data(i), VertexColor.WHITE))
v[0].data.name = "u"
v[1].data.name = "v"
if 'size' in commands:
size = int(commands[1])
graph = Graph(size)
elif 'addEdge' in commands:
u = int(commands[1])
v = int(commands[2])
graph.addEdge(u, v)
print('Added Edge')
print("(u,v) \t", u, '->', v)
elif 'BFS' in commands:
# print("BFS:")
s = int(commands[1])
print("Run Bfs on Source:", s)
graph.BFS(s)
graph.printParents()
graph.printDistance()
elif 'DFS' in commands:
graph.DFS()
graph.printParents()
graph.printColors()
graph.printStamps()
elif 'printGraph' in commands:
graph.printGraph()
else:
print('ERROR:\t command {} not found'.format(line))
# for cmd in lines:
def test012_DFS1_BFS1_xDFS1_xDFS1_aview1_wview1():
"""
>>> g = Graph()
>>> g.DFS("a")
Traceback (most recent call last):
...
assert startNode in self_a
AssertionError
"""
g = Graph({
'a': {
'c': 0,
'b': 0
},
'c': {
'e': 0
},
'b': {
'e': 0,
'd': 0,
'f': 0
},
'e': {
'f': 0
},
'd': {
'f': 0
},
'g': {},
'f': {
'g': 0
}
})
assert g.short() == "a>b,c b>d,e,f c>e d>f e>f f>g g"
assert g.short(out=False) == "a b<a c<a d<b e<b,c f<b,d,e g<f"
a = """\
Adjacency matrix (1=arc present, 2=self loop, "." or 0=absent):
a b c d e f g
a: | . 1 1 . . . . |
b: | . . . 1 1 1 . |
c: | . . . . 1 . . |
d: | . . . . . 1 . |
e: | . . . . . 1 . |
f: | . . . . . . 1 |
g: | . . . . . . . |"""
assert g.aview() == a
w = """\
Adjacency Matrix of weights (values = arc weights, "." = absent arc):
a b c d e f g
a: | . 0 0 . . . . |
b: | . . . 0 0 0 . |
c: | . . . . 0 . . |
d: | . . . . . 0 . |
e: | . . . . . 0 . |
f: | . . . . . . 0 |
g: | . . . . . . . |"""
assert g.wview() == w
assert g.DFS("a", sort=True) == ['a', 'b', 'd', 'f', 'g', 'e', 'c']
assert g.DFS("b", sort=True) == ['b', 'd', 'f', 'g', 'e']
assert g.BFS("a", sort=True) == ['a', 'b', 'c', 'd', 'e', 'f', 'g']
assert g.BFS("b", sort=True) == ['b', 'd', 'e', 'f', 'g']
assert list(g.xDFS("a", sort=True)) == ['a', 'b', 'd', 'f', 'g', 'e', 'c']
assert list(g.xDFS("b", sort=True)) == ['b', 'd', 'f', 'g', 'e']
assert list(g.xBFS("a", sort=True)) == ['a', 'b', 'c', 'd', 'e', 'f', 'g']
assert list(g.xBFS("b", sort=True)) == ['b', 'd', 'e', 'f', 'g']
