rajon_aust's blog

Need solution idea for Spoj HIGH — Highways
By rajon_aust, history, 10 years ago, In English

I don't find any solution idea for this problem . I am totally stuck in this problem . If anyone solve the problem , please give me the idea for this problem . Thanks in advance !

http://www.spoj.com/problems/HIGH/

  • Vote: I like it
  • 0
  • Vote: I do not like it

Comments Comments (9)
| Write comment?
»
10 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by rajon_aust (previous revision, new revision, compare).

→ Reply
»
10 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

OP changed the question from HIGHWAY — > HIGH . This comment is uselss

→ Reply
»
10 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by rajon_aust (previous revision, new revision, compare).

→ Reply
»
10 years ago, # |
  Vote: I like it +1 Vote: I do not like it

I think the problem is just counting spanning trees

→ Reply
  • »
    »
    10 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Any more good resources to understand the algorithm ? Thanks a lot for giving the link of algorithm .

    → Reply
    • »
      »
      »
      10 years ago, # ^ |
        Vote: I like it +1 Vote: I do not like it

      Just try Googling "counting spanning trees," or "Kirchoff's theorem" and there are a lot of sources. Here's a proof, and here's how to find a determinant

      → Reply
      • »
        »
        »
        »
        10 years ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        Thanks a lot ! I will try my best to solve the problem .

        → Reply
      • »
        »
        »
        »
        10 years ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        Thanks a lot . Finally I solved the problem !

        → Reply