Loading ExempleEdgeConnectivity.py +2 −2 Changes for ExempleEdgeConnectivity.py: 2 added lines, 2 removed lines. Original line number Diff line number Diff line Loading @@ -25,6 +25,6 @@ G=igraph.Graph.Adjacency(M.tolist(),"MAX") # G.get_edgelist()[6] correspond à l'arête U2-U7 # G.get_edgelist()[13] correspond à l'arête U7-U8 G.edge_connectivity(G.get_edgelist()[6][0],G.get_edgelist()[6][1]) print("edge_connectivity entre U2 et U7 :",G.edge_connectivity(G.get_edgelist()[6][0],G.get_edgelist()[6][1])) G.edge_connectivity(G.get_edgelist()[13][0],G.get_edgelist()[13][1]) No newline at end of file print("edge_connectivity entre U7 et U8 :",G.edge_connectivity(G.get_edgelist()[13][0],G.get_edgelist()[13][1])) No newline at end of file Loading
ExempleEdgeConnectivity.py +2 −2 Changes for ExempleEdgeConnectivity.py: 2 added lines, 2 removed lines. Original line number Diff line number Diff line Loading @@ -25,6 +25,6 @@ G=igraph.Graph.Adjacency(M.tolist(),"MAX") # G.get_edgelist()[6] correspond à l'arête U2-U7 # G.get_edgelist()[13] correspond à l'arête U7-U8 G.edge_connectivity(G.get_edgelist()[6][0],G.get_edgelist()[6][1]) print("edge_connectivity entre U2 et U7 :",G.edge_connectivity(G.get_edgelist()[6][0],G.get_edgelist()[6][1])) G.edge_connectivity(G.get_edgelist()[13][0],G.get_edgelist()[13][1]) No newline at end of file print("edge_connectivity entre U7 et U8 :",G.edge_connectivity(G.get_edgelist()[13][0],G.get_edgelist()[13][1])) No newline at end of file