| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3803 |
| 2 | jiangly | 3707 |
| 3 | Benq | 3627 |
| 4 | ecnerwala | 3584 |
| 5 | orzdevinwang | 3573 |
| 6 | Geothermal | 3569 |
| 6 | cnnfls_csy | 3569 |
| 8 | Radewoosh | 3542 |
| 9 | jqdai0815 | 3532 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 168 |
| 2 | awoo | 163 |
| 3 | adamant | 162 |
| 4 | maroonrk | 152 |
| 5 | nor | 151 |
| 5 | -is-this-fft- | 151 |
| 7 | atcoder_official | 147 |
| 7 | TheScrasse | 147 |
| 9 | Petr | 145 |
| 10 | pajenegod | 144 |
Hey codeforces,
I made a Graph Visualizer Website, where people can plot graphs and simulate the graph algorithms like DFS, BFS, TopoSort, Dijkstra's Algorithm etc.
Could you please try it out and let me know how it is and how I can improve it?
Link: https://abhilesh1412.github.io/Graph-Visualizer/
Thank You!
I recommended to you'r website * Interactive(Plot Graph not need). * Matrix input
Okay, I will also add the feature for matrix input. Thank you for your feedback.
I want the ability to export svg. Thanks
Done!!!
Added the functionality to export the graph as svg.
Wow nice. Thank you very much. This is a useful feature that csacademy graph tool doesn't have!
Hey, really nice website! I was playing around with it and noticed that for an undirected graph, it detects cycles with only $$$2$$$ nodes (that is, parent to child and back to parent) as valid cycles, which I don't think is intended.
The graph I used:
5 5 1 2 2 3 3 4 2 4 3 5Also, by default, when I plot a graph, the vertices and edges are all clustered up in the center and overlap a lot. I need to manually drag them apart to make the graph understandable. It would be nice if you could change this default behaviour.
Hey @avighnakc,
Thank you for the feedback, I corrected the mistake of detect cycle in undirected graph.
Suggestion 1: Show the codes for each algorithm.
Suggestion 2: Let the user submit a code, and give you the name of some variables to watch, and when it runs the code on the graph, the variables that are supposed to be watched get updated in execution(like the default Dijkstra).
Suggestion 3[low attention]: a better theme
Suggestion 4[low attention]: the weights on the weighted edges are a bit badly placed
I think your Suggestion 2 is too difficult to implement.
And i think it is not important to show the code for each algorithm. I don't know why you want the code.
Thank you very much for your feedback and suggestions @bgopc
But, I agree with @Roeu that suggestion 2 is too difficult to implement and it is not important to show the code of each algorithm. If they want to see the code they can go to the GFG.
According to me I can just provide a link of that particular algorithm. So that, they can see the code of the algorithm.
And, I will see what I can do with the suggestion 3rd and 4th.
Once again, thank you.