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 | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | adamant | 152 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 144 |
| 5 | errorgorn | 141 |
| 6 | cry | 139 |
| 7 | Proof_by_QED | 137 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
| 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?