andrewytliu / cspice Goto Github PK

Could you please provide some proof of concepts.
For instance, I came across a paper on automated circuit simulation using graph
theory.
https://www.researchgate.net/publication/273890629_Using_graph_theory_for_automated_electric_circuit_solving

The idea is basically two fold.

1. Find minimum amount of loops/circle that ensure all edges run through

2. Use Kirchhoff law for voltage to set up a system of n equations, one
   for each of the n independent loops.

I want to see how yours is different, in term of the ideas/methodology.

Thanks

Hi Guys,

Have you remove the parseYY.hpp?

This is an introduction to spice netlist file format, our file format may base on it.
http://www.ecircuitcenter.com/basics.htm