FEA
Summary of graph complexity

The larger the value of (E + P) / N then the more complex the directed graph is, where

The value of (E + P - N) / N varies between 0 and N. A stricly layered architecture will have a value of 0.

The sum of (E + P - N) is 42, sum of (E + P - N) / N is 3.02.

Section N E + P - N (E + P - N) / N
FEA 7 8 1.14
FEA::Core::Elements 47 21 0.45
Linear::Algebra 15 6 0.40
FEA::Core 3 1 0.33
Top level 4 1 0.25
FEA::Surface 4 1 0.25
FEA::Equations 7 1 0.14
Linear::Solvers 52 3 0.06
App 1 0 0.00
FEA::Assembly 2 0 0.00
FEA::Core::Fields 17 0 0.00
FEA::Core::SetOfElements 2 0 0.00
FEA::FileIO 9 0 0.00
FEA::Mesh 2 0 0.00
FEA::Solver 2 0 0.00
Linear 2 0 0.00
Tests 4 0 0.00
Tests::App 8 0 0.00
Tests::Classes 16 0 0.00
Tests::Linear 3 0 0.00
Tests::Utils 1 0 0.00