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 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | adamant | 157 |
6 | awoo | 157 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | djm03178 | 153 |
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?