igure 4: Graphs can be classi-

fied based on their edge weights

(weighted/binary) and directionality

(directed/undirected). It is possible

to transform a directed graph into an

undirected one by symmetrization (i.e.

by removing the information about the

edge directions), and a weighted graph

into a binary one by thresholding (i.e.

by assigning a value of 1 to the edges

above a given threshold and 0 to those

below the threshold).