Challenge: Count the Number of Edges in an Undirected Graph

Statement

Given an n number of nodes in an undirected graph, compute the total number of edges.

Constraints:

• $0 \leq$n$\leq 10^2$

• $0 \leq$edges.length $\leq n(n-1)/2$

• edges[i].length $== 2$

• $1 \leq x,y \leq$n

• $x\neq y$

• There are no multiple edges between any two vertices

• There are no self-loops

Examples