Now that you can store the graph, you'll look at a property of nodes. The Degree of a node is the number of edges connected to it.
If node has edges to nodes , , and , its degree is . In an undirected graph, summing all degrees gives (each edge contributes to two nodes). This identity helps verify your input parsing. High-degree nodes often appear in graph problems. The "center" of a star graph has maximum degree. Tracking degrees helps solve problems like finding hubs or detecting anomalies.