随机算法 (Fall 2011)/Electrical Network: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2011

  • curprev 14:0314:03, 24 December 2011imported>Zhangchihaom 4,817 bytes +12 No edit summary
  • curprev 13:5813:58, 24 December 2011imported>Zhangchihaom 4,805 bytes −99 No edit summary
  • curprev 13:5313:53, 24 December 2011imported>Zhangchihao 4,904 bytes +4,904 Created page with "An undirected graph <math>G=(V,E)</math> is called an '''electrical network''', if # Every edge <math>e=\{u,v\}</math> is associated with resistance <math>R_{uv}</math>. # The f…"