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 8, sum of (E + P - N) / N is 1.27.

Section N E + P - N (E + P - N) / N
FEA 6 4 0.67
Top level 3 1 0.33
Linear::Algebra 11 3 0.27
FEA::Core 4 0 0.00
FEA::Core::Elements 50 0 0.00
FEA::Core::Factory 2 0 0.00
FEA::Core::Fields 17 0 0.00
FEA::Core::Integration 2 0 0.00
FEA::Equations 7 0 0.00
FEA::FileIO 9 0 0.00
FEA::LinearSystem 2 0 0.00
FEA::Mesh 2 0 0.00
FEA::Solver 2 0 0.00
Linear 3 0 0.00
Linear::FileIO 4 0 0.00
Linear::Solvers 52 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