0
\$\begingroup\$

For some reason I can't wrap my head around this concept. I find it really hard to find the loops in circuits. This is problem, since I can create all the equations from second Kirchhoff law. Is there any precise algorithm, which I can use to find them. When I'm searching for the loops i'm starting from the top-right element and go to the lowest-left element. But I'm constantly missing loops. I'll give an example of the process which is happening in my head when I'm searching for loops. Given this circuit: enter image description here

  1. Start from R1, pass through the whole circuit 1st loop
  2. Start from R1, pass through r2 then v2 and r3, 2nd loop
  3. Start from R2, pass through R4 then V3 and R5, 3rd loop
  4. Start from R3, pass through R6 then R4 4th loop
    I don't see any other loops on the circuit
\$\endgroup\$
4
  • \$\begingroup\$ Looks like you found all loops. So what's the question? \$\endgroup\$ Commented Dec 16, 2017 at 18:43
  • 1
    \$\begingroup\$ I'm asking if this is the right way to do it. Or a way to determine if this is the correct count. \$\endgroup\$ Commented Dec 16, 2017 at 18:48
  • \$\begingroup\$ More like an aptitude question. No algo n all. Just observe carefully to find all loops. \$\endgroup\$
    – Mitu Raj
    Commented Dec 16, 2017 at 19:06
  • \$\begingroup\$ I forgot to add the word "Relevant". You got all the relevant loops. \$\endgroup\$ Commented Dec 18, 2017 at 1:52

1 Answer 1

0
\$\begingroup\$

You missed some R6,R4,R2,R1,BACK TO R6 R1,R3,V2,R4,V3,R5,R1

Algorithms for loops are found in graph theory (trees, etc.). You are seeing why node analysis is much easier to set up

\$\endgroup\$
4
  • \$\begingroup\$ I just want to add this math.stackexchange.com/questions/1124463/network-theorem it gives a way to determine the number of loops in the circuit, based on nodes and branches \$\endgroup\$ Commented Dec 16, 2017 at 19:25
  • 1
    \$\begingroup\$ yes, this formula gives you the number of loops, but doesn't tell you where they are. Nevertheless, it gives a good check that you've found them all. \$\endgroup\$ Commented Dec 16, 2017 at 19:33
  • \$\begingroup\$ Been many years since I've taught ckts. The formula \$\endgroup\$ Commented Dec 16, 2017 at 19:52
  • \$\begingroup\$ cut myself off. Forgot formula L = B - N + 1 only gives # of INDEPENDENT loops. \$\endgroup\$ Commented Dec 16, 2017 at 20:03

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.