We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
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.
Find minimum amount of loops/circle that ensure all edges run through
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
The text was updated successfully, but these errors were encountered:
No branches or pull requests
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.
Find minimum amount of loops/circle that ensure all edges run through
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
The text was updated successfully, but these errors were encountered: