Graphs are a very broad term that loosely means something with one or more Nodes#1.3.6.1.4.1.33097.1.0.12.0 and zero or more Edges#1.3.6.1.4.1.33097.1.0.12.0.
Cycles#1.3.6.1.4.1.33097.1.0.12.5 are a common topic of concern related to Graphs. They often cause problems like infinite loops when Exploring#1.3.6.1.4.1.33097.0.0.6 Graphs, which can be avoided via Memoization.
NodeNetworkSetGaps are simply gaps between NodeNetworks#1.3.6.1.4.1.33097.1.0.12 in a Graph. They identify a type of Graph that is somewhat under represented in the Graph Theory literature.
Graphs are great for discovering relationships programmatically. Think of your typical detective show or movie where the board of suspects is somewhere in the detectives office with string connecting pictures of people, places and things (a classic Graph problem).
Graphs have been studied heavily and have their own named discipline in mathmatics Graph Theory.
Graphs are less structured than Relational Data and often result in complex structures. This can lead to slow access times, random representations of data types (integers, decimals, etc) and complex tools are required to access and create Graphs.
#####
Cool characters •, →, ←, ↓, ↑, ↗, ↖, ↙, ↘
https://en.wikipedia.org/wiki/Graph_theory
https://medium.com/basecs/a-gentle-introduction-to-graph-theory-77969829ead8