-
Notifications
You must be signed in to change notification settings - Fork 0
/
graph.py
56 lines (45 loc) · 1.75 KB
/
graph.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
class Node:
def __init__(self, value, neighbours=None):
self.value = value
if neighbours is None:
self.neighbours = []
else:
self.neighbours = neighbours
def addNeighbour(self, neighbour):
self.neighbours.append(neighbour)
class Edge:
def __init__(self, node1, node2, weight):
self.node1 = node1
self.node2 = node2
self.weight = weight
class Graph:
def __init__(self, nodes=None):
if nodes is None:
self.nodes = []
else:
self.nodes = nodes
self.edges = []
def addNode(self, node):
self.nodes.append(node)
def findNode(self, value):
for node in self.nodes:
if node.value == value:
return node
return None
def areConnected(self, node1, node2):
u = self.findNode(node1)
v = self.findNode(node2)
for neighbour in u.neighbours: # Controllo se nei vicini del primo nodo sia presente il seconod nodo
if neighbour[0].value == v.value:
return True
return False
def addEdge(self, value1, value2, weight=1):
node1 = self.findNode(value1)
node2 = self.findNode(value2)
if (node1 is not None) and (node2 is not None):
node1.addNeighbour((node2, weight)) # Nodi di controllo per check di inserimento nel grafo
node2.addNeighbour((node1, weight))
self.edges.append(Edge(node1, node2, weight)) # Aggiungo archi per convertire lista in dizionario per Prim (graphConvert)
self.edges.append(Edge(node2, node1, weight)) # Essendo grafo non diretto
else:
raise Exception("Errore: uno o più nodi non trovati!")