Skip to main content
Mathematica

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

5
  • $\begingroup$ If anything left unclear, comment anytime~ $\endgroup$ Commented Aug 21, 2016 at 15:32
  • 1
    $\begingroup$ I will appreciate a good solution a ton, as I've been trying to solve this problem for days. And also, this is the last piece of this big program. I'll contribute the code when the program is eventually completed. $\endgroup$ Commented Aug 21, 2016 at 15:33
  • 1
    $\begingroup$ I don't really get what you mean by resistences between point 1, 3 and 11. Isn't the resistance only defined between two individual points; for that problem I think I found a solution $\endgroup$ Commented Aug 21, 2016 at 16:00
  • $\begingroup$ I can't write a complete answer for now, but I once had a similar problem and removed "single dead ends" (19-12,16-10,...) as follows: //1. Create adjacency matrix. 2. Check for vertices connected only to one point. 3. Remove them. 4. Repeat. // For the other ones (e.g. 14-13-0-12) you should find another algorithm. $\endgroup$ Commented Aug 21, 2016 at 16:00
  • 1
    $\begingroup$ The restriction to graph theory seems a bit strange, since the algebra is straightforward, especially in Mathematica with Eliminate. And, of course, the algebra can take you other places... $\endgroup$ Commented Aug 21, 2016 at 22:22