Computer networks are probably the best example of graphs these days. I started therefore to consider graph database as an excellent tool for storing experimental results of my networking complexity analysis method. It’s a project that I’m doing (starting to do) in which I will try to create a better method of computer network complexity audit by combining few of already existing methods and by additionally enhancing some of their algorithms to get more precise results out of the whole thing.
The idea is that most of network complexity measurement mechanism rely strongly on graph theory in which most metrics for measuring network/graph complexity is related to connectivity, node distance, and similar graph characteristics but with no particular way of measuring implementation complexity nor operation complexity of resulting network. Furthermore, existing methods do not contain a way to evaluate network system from economic perspective in any way, which would greatly increase the use cases for this new method, specifically in planing and designing phases.