def create_graph(initialGraph, validVertices):
result_graph = Graph(0)
for vertex in validVertices:
result_graph.add_vertex(vertex)
for vertex in validVertices:
for neighbour in initialGraph.parse_neighbours(vertex):
if not result_graph.is_edge(vertex, neighbour):
result_graph.add_edge(vertex, neighbour,
initialGraph.get_cost(vertex, neighbour))
return result_graph
def read_file(file):
try:
f = open(file, 'r')
except exceptionGraph:
raise exceptionGraph("The file is not available")
firstLine = f.readline().strip().split()
graph = Graph(0)
number_of_vertices = int(firstLine[0])
line = f.readline()
while line != "":
edge = line.strip().split()
vertex1 = int(edge[0])
vertex2 = int(edge[1])
if vertex1 not in graph.parse_vertices():
graph.add_vertex(vertex1)
if vertex2 not in graph.parse_vertices() and vertex2 != -1:
graph.add_vertex(vertex2)
if len(edge) == 3 and vertex1 != vertex2 and not graph.is_edge(
vertex1, vertex2):
graph.add_edge(vertex1, vertex2, int(edge[2]))
line = f.readline()
if number_of_vertices != graph.get_nr_of_vertices():
for vertex in range(number_of_vertices):
if vertex not in graph.parse_vertices():
graph.add_vertex(vertex)
f.close()
return graph