Introduction - If you have any usage issues, please Google them yourself
Given network N, and its associated matrix A, basic circuit matrix, the basic cut set matrix.
Given the network N, the node admittance matrix Y is formed and the inverse Z is obtained. The network is added to the network after adding a branch (tree branch / branch).
The use of sparse storage technology to achieve the search; node optimization technology (dynamic, semi dynamic); factor table technology.