[Python and Sage Question]

All computations should use the SageMath 9.0 kernel. However, you are free to mix Python and Sage functionality in your code.

Problem 4: Network data from a CSV file Grading criteria: code correctness. This problem is based on a dataset derived from a workshop in 1992. Source: UCINET via this page. a. Use pandas to read the CSV file "Camp 92.txt" into a DataFrame. In [ ]: b. The rows and columns of this DataFrame are indexed by the names of participants in the workshop. Now create a complete undirected graph with vertices labeled by the names of the participants in the 38 workshop, in which each edge is labeled by the sum of the two entries in the DataFrame corresponding to this pair of participants. (For example, row HOLLEY meets column BRAZEY in an entry 2, while row BRAZEY meets column HOLLEY in an entry 1; thus the edge from HOLLEY to BRAZEY should be labeled 3.) In [ ]: C. Let G be the graph you constructed in b. For each nonnegative integer n, let Gn be the subgraph of G consisting of all edges whose label is at least n. Find the largest value of n for which Gn is connected. In [ ]: Problem 4: Network data from a CSV file Grading criteria: code correctness. This problem is based on a dataset derived from a workshop in 1992. Source: UCINET via this page. a. Use pandas to read the CSV file "Camp 92.txt" into a DataFrame. In [ ]: b. The rows and columns of this DataFrame are indexed by the names of participants in the workshop. Now create a complete undirected graph with vertices labeled by the names of the participants in the 38 workshop, in which each edge is labeled by the sum of the two entries in the DataFrame corresponding to this pair of participants. (For example, row HOLLEY meets column BRAZEY in an entry 2, while row BRAZEY meets column HOLLEY in an entry 1; thus the edge from HOLLEY to BRAZEY should be labeled 3.) In [ ]: C. Let G be the graph you constructed in b. For each nonnegative integer n, let Gn be the subgraph of G consisting of all edges whose label is at least n. Find the largest value of n for which Gn is connected. In [ ]