Esempio n. 1
0
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
Esempio n. 2
0
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
Esempio n. 3
0
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
Esempio n. 4
0
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