Skip to main content
. 2017 Oct 10;12(10):e0184344. doi: 10.1371/journal.pone.0184344

Fig 2. Edge dual graph.

Fig 2

Transformation from edge-weighted graph (A) to a corresponding edge-dual graph (B). Edges between nodes become vertices and are connected by links if they share a node in the original graph.