def topology1():
graph = Topology().nx_graph()
graph.remove_nodes_from([2, 3, 4, 5])
# graph.remove_edges_from([(101,103),(103,104),(104,106)])
return graph
def topology1():
graph = Topology().nx_graph()
graph.remove_nodes_from([2,3,4,5])
# graph.remove_edges_from([(101,103),(103,104),(104,106)])
return graph
def topology3():
graph = Topology().nx_graph()
graph.remove_nodes_from([3, 5])
# graph.remove_edges_from([(101,103),(103,104),(104,106)])
policy = shortest_path_policy(graph)
return graph
def topology3():
graph = Topology().nx_graph()
graph.remove_nodes_from([3,5])
# graph.remove_edges_from([(101,103),(103,104),(104,106)])
policy = shortest_path_policy(graph)
return graph
