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 ?
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3382 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
| Name |
|---|



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];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
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
Sorry for off-topic question,
How to implement dfs in python?