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")
Bu egzersiz, kursun bir parçasıdır
Case Studies: Network Analysis in R
Uygulamalı etkileşimli egzersiz
Bu egzersizi bu örnek kodu tamamlayarak deneyin.
# Make an ego graph from the first partition
ego_partition1 <- ___(trip_g_ud, nodes = ___$partition1)[[1]]
# Plot the ego graph
plot(___)