What problem does it solve? Working with network and graph data in Python requires knowing dozens of algorithms, file formats, and visualization options. This Skill provides structured guidance for building graphs, running analyses like centrality and community detection, and producing clear network visualizations without memorizing the NetworkX API. ## Core Features & Use Cases - Graph Creation & Manipulation: Build directed, undirected, and multi-edge graphs from edge lists, DataFrames, NumPy arrays, or files like GraphML and GML. - Graph Algorithms: Compute shortest paths, centrality measures, PageRank, clustering coefficients, community detection, maximum flow, and minimum spanning trees. - Synthetic Network Generation: Generate random, scale-free, small-world, lattice, and social network models for testing and simulation. - Visualization: Draw networks with matplotlib layouts, customize node and edge appearance, and export publication-quality figures or interactive Plotly/PyVis visualizations. - Use Case: Given a CSV of protein interactions, load it into a graph, detect communities with greedy modularity, compute betweenness centrality to find key proteins, and export a colored network figure. ## Quick Start Use the networkx skill to load my edges.csv file, compute PageRank for every node, and draw the network with node sizes scaled by centrality.