Skip to main content
. 2017 Aug 1;12(8):e0178798. doi: 10.1371/journal.pone.0178798

Fig 2. Types of graphs.

Fig 2

Graphs can be classified based on their edge weights (weighted or binary) and directionality (directed or 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 threshold).