Question

Randomly Generate a Graph Accept a positive integer $n$ from keyboard and then create a random undirected graph with $n$ nodes. Suppose the probability that node $i$ and node $j$ is connected by an edge is 0.25 (you can change this probability yourself). If node $i$ and node $j$ are connected by an edge, we suppose weight of the edge is a random integer within the range of $[1, 5n)$. We further suppose there is no self-looping edge for each node, and there is one and only one edge between two nodes if these two nodes are indeed connected. For example, suppose we accepted integer 5 from keyboard, we generate the following random graph: Node list: {1,2,3,4,5} Edge list: {(1,2,3), (1, 3, 6), (1, 4, 5), (2, 3, 7), (3, 4, 6), (3,5,5), (4,5,2)} Node that each edge in the edge list has the form ($v_i$, $v_j$, $w$) with the meaning that node $v_i$ and $v_j$ are connected by an edge with the weight of $w$.

          Randomly Generate a Graph
Accept a positive integer $n$ from keyboard and then create a random undirected graph with $n$ nodes. Suppose the
probability that node $i$ and node $j$ is connected by an edge is 0.25 (you can change this probability yourself). If
node $i$ and node $j$ are connected by an edge, we suppose weight of the edge is a random integer within the range of
$[1, 5n)$. We further suppose there is no self-looping edge for each node, and there is one and only one edge between
two nodes if these two nodes are indeed connected.
For example, suppose we accepted integer 5 from keyboard, we generate the following random graph:
Node list: {1,2,3,4,5}
Edge list: {(1,2,3), (1, 3, 6), (1, 4, 5), (2, 3, 7), (3, 4, 6), (3,5,5), (4,5,2)}
Node that each edge in the edge list has the form ($v_i$, $v_j$, $w$) with the meaning that node $v_i$ and $v_j$ are connected by
an edge with the weight of $w$.

Randomly Generate a Graph
Accept a positive integer n from keyboard and then create a random undirected graph with n nodes. Suppose the
probability that node i and node j is connected by an edge is 0.25 (you can change this probability yourself). If
node i and node j are connected by an edge, we suppose weight of the edge is a random integer within the range of
[1, 5n). We further suppose there is no self-looping edge for each node, and there is one and only one edge between
two nodes if these two nodes are indeed connected.
For example, suppose we accepted integer 5 from keyboard, we generate the following random graph:
Node list: 1,2,3,4,5
Edge list: (1,2,3), (1, 3, 6), (1, 4, 5), (2, 3, 7), (3, 4, 6), (3,5,5), (4,5,2)
Node that each edge in the edge list has the form (vi, vj, w) with the meaning that node vi and vj are connected by
an edge with the weight of w.

Added by Logan H.

Question

Please give Ace some feedback