forked from psounis/python
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathgraph.py
More file actions
40 lines (32 loc) · 1.13 KB
/
graph.py
File metadata and controls
40 lines (32 loc) · 1.13 KB
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
class Node:
def __init__(self, descr="", neighbors=None):
self.descr = descr
if neighbors is None:
self.neighbors = []
else:
self.neighbors = neighbors
class Graph:
def __init__(self):
self.nodes = []
def add_vertex(self, descr="", neighbors=None):
if neighbors is None:
neighbors = []
self.nodes += [Node(descr, neighbors)]
def __index_of(self, descr):
for i in range(len(self.nodes)):
if descr == self.nodes[i].descr:
return i
def add_edge(self, descr1, descr2):
index1 = self.__index_of(descr1)
index2 = self.__index_of(descr2)
self.nodes[index1].neighbors += [self.nodes[index2]]
self.nodes[index2].neighbors += [self.nodes[index1]]
def neighbors(self, descr):
return self.nodes[self.__index_of(descr)].neighbors
def __str__(self):
st = ""
for node in self.nodes:
st += f"\n{node.descr}: "
for neighbor in node.neighbors:
st += f" {neighbor.descr}"
return st