Skip to main content
Figure 4 | EPJ Data Science

Figure 4

From: Complex network analysis of teaching practices

Figure 4

Construction of MST and PMFG graphs. The solid lines in (a) show a MST graph built from decreasing order of edge weights i.e. the edges with the highest weights are included first. The edges represented by dashed lines with weights 8, 4, and 1 are not included since they will result in loops in the network. (b), (c), and (d) shows the properties of the PMFG. Even though the edges in (b) intersect, the graph is planar. This is because the lines can easily be redrawn such that they do not intersect like in (c). However, if the new blue edge is added to the graph (d) there is no way to redraw the edges or rearrange the nodes such that the links never intersect. Therefore the graph in (d) is not planar.

Back to article page