Maximum number of edges in a n—node undirected graph withoutself-loops is

A

$$n^{2}$$

B

$$\frac{n(n-1)}{2}$$

C

n-1

D

$$\frac{n(n+1)}{2}$$