Home

This projects has three parts:

PART ONE

This part is an illustration of an directed weighted graph.

The graph is implemented by 3 main sections:

• The vertex section which signifies a single node.
• The graph section which implements and shows the graph Data structure which all nodes are based in.
• Juint tests.

PART TWO

This part is the algorithms part of the graph including methods that allows you to:

• Save a graph in a json format and load from json.
• Find the shortest path using the dijkstra algorithm.

• Get information about the connected component in the graph using the tarjan algorithm.

• Get an image of the graph.

This part is using by 4 main sections:

• The graph Algorithms section in which the graph uses to perform the various tasks.
• The Special Algorithms section.
• The Visual responsible for painting the graph.
• Juint tests.

Example for graph with given positions:

Examples to graphs with random positions:

PART THREE

To check out comparison data click here or in the side menu bar:

• Score Table
• Comparison To Networkx
• Comparison Graphs