Mike Ferguson of IBM further defines four ‘types’ of graph analytics here. Path analysis: Determines the shortest distance between two nodes in a graph.

The study of such graphs is called graph theory. Engineers need to find planarity in a graph when, for example, they are designing a computer chip without a crossed wire.