Find the minimum cut 2

Another function for cutting graphs into several smaller graphs is stMincuts(). This requires the graph and the IDs of two vertices, and tells you minimum number of cuts needed in the graph to disconnect them (specified by the value element of the function output). The syntax for this function is:

stMincuts(graph, "node1", "node2")

Use make_ego_graph() to make a graph of the first partition of ud_cut and the nodes that link to it.
- Pass the whole graph, trip_g_ud.
- Set the nodes to partition1 of ud_cut.
Plot ego_partition1.

Take Hint (-15 XP)

Exercise

Find the minimum cut 2

Instructions 1/3