What Is It About?
In this assigment we used python for the first time!
We created classes that represent directed weighted graph.
Main Uses
- Simple operations on the graph such as:
- Adding and removing vertices.
- Adding and removing edges.
- Getting number of edges, vertices and changes made in the graph.
for more information check out part one in the wiki pages
- More complicated operations on the graph such as:
- Getting the shortest path between two vertices and the distance between them, using the Dijkstra algorithm.
- Getting the SCC in the graph and a specific vertex' SCC, using the Tarjan algorithm.
- Saving the graph to a json format and loding a graph from a json format.
- Drawing the graph.
Example to a graph with given positions:
Examples to graphs with random positions:
for more information check out part two in the wiki pages
Compared To Other:
In this project we compared our work at Java (assigment two in this course) and the standard library in python- networkx.
Here are the results:
for more information check out part three in the wiki pages
About Us
We are Neta Roth and Tal Somech, second year students in the Ariel University.
You can catch up our latest work in the links below:
-
NETA ROTH: Neta's github
-
TAL SOMECH: Tal's github