After tracing all circuits in L' we obtain the first and simplest KL invariant the component number c. On the other hand, from every 4valent plane graph L' we can obtain a link L, such that L' is a shadow of L, and the number of circuits c in L obtained by the Component Algorithm is the number of components of L. The LinKnot function fComponentNo (webMathematica fComponentNo) calculates the number of components of any KL. In the existing KL tables,
all KLs are strongly divided into separate classes, according to the number
of components. In our discussion, we will try to work with all of them
together far as it is possible, trying to find some order in the complete
set of KLs and make their classification.
