Rating changes for last rounds are temporarily rolled back. They will be returned soon. ×

Armyx's blog

Graph — Java representation
By Armyx, 9 years ago, In English

What is the the best graph representation in Java ? I used this 

List<Integer> Graph[] = new List[n]

but is there any better implementation ? How to represent weighted graphs ?

  • Vote: I like it
  • +5
  • Vote: I do not like it

»
9 years ago, # |
← Rev. 4   Vote: I like it +8 Vote: I do not like it

How I would answer this question had I had it myself:

Problemset > Select Problem with tag 'graphs' or 'dfs' > Check code of 3 or more top rated Java coders.

EDIT: That being said, I think the kind I've seen most use is

List<Integer> adjLst[] = new ArrayList[N];

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

    unweighted graph it's easy, but weighted graph is a little more complicated. Code of 3 or mote top rated Java coders doesn't imply to be well written

    → Reply
    • »
      »
      »
      9 years ago, # ^ |
      ← Rev. 3   Vote: I like it +5 Vote: I do not like it

      Are you seriously telling me that top rated coders may not know how to code a weighted graph efficiently? :)

      EDIT: So you mean to tell me that you will accept the advice of a not-top-rated-coder instead of looking at a top-rated-coder's solution? Good luck :D

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

Sorry for off-topic question,

How to implement dfs in python?

→ Reply