Για τα metrics 2 λογια να τα χεις full είναι πολύ απλα!

The density of a graph is defined as the number of lines in a graph, expressed as a proportion of the maximum

possible number of lines (n). The formula for the density is where 1 is the number of lines present.
This measure can vary from 0 to 1, the density of a complete graph being 1. The densities of various graphs can be
seen in Figure 4.4: each graph contains four points and so could contain a maximum of six lines. It can be seen
how the density varies with the inclusiveness and the sum of the degrees.

In graph theory, the degree (or valency) of a vertex of a graph is the number of edges incident to the vertex,
with loops counted twice.[1] The degree of a vertex v is denoted deg(v). The maximum degree of a graph G, denoted by
Δ(G), and the minimum degree of a graph, denoted by δ(G), are the maximum and minimum degree of its vertices. In the
graph on the right, the maximum degree is 3 and the minimum degree is 0. In a regular graph, all degrees are the same, and
so we can speak of the degree of the graph.

Το average degree είναι ο μέσος όρος των συνδέσεων που κανει ενας node.