Challenge: Count the Number of Edges in an Undirected Graph

The task involves calculating the total number of edges in an undirected graph with n nodes, adhering to specific constraints. The graph is defined such that there are no multiple edges between any two vertices and no self-loops. The number of edges can range from 0 to a maximum of n(n-1)/2, where edges are represented as pairs of nodes.