GitHub - codewithx4/graph_visualizer: This Python script uses Dijkstra's algorithm to find shortest paths in a weighted graph. It takes user input to create the graph, then visualizes and prints the shortest distances from a specified starting vertex. The code utilizes the `networkx` and `matplotlib.pyplot` libraries for graph representation and visualization.

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
animated_using_html_js.html		animated_using_html_js.html
main.py		main.py

About

This Python script uses Dijkstra's algorithm to find shortest paths in a weighted graph. It takes user input to create the graph, then visualizes and prints the shortest distances from a specified starting vertex. The code utilizes the `networkx` and `matplotlib.pyplot` libraries for graph representation and visualization.