Skip to main content
. 2018 Feb 2;13(2):e0191604. doi: 10.1371/journal.pone.0191604

Fig 1. Optimal rank and agony (d = 1) for simple graphs.

Fig 1

On the top, the graphs are represented without any ordering, on the bottom nodes are divided according to their ranks. The red links are the backward ones, those contributing to agony, and the black links are the forward ones.