Home

introduction:

This task is about Design and implementation of directed and weighted graphs in python & comparetion between the implementetion in java.

Before we start to talk about our task in python, let's talk about graphs.

Graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense "related". The objects called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called link or line) Typically, a graph is depicted in diagrammatic form as a set of dots or circles for the vertices, joined by lines or curves for the edges.

Directed Graph is a graph in which the edges have orientations. The edge (x,y) directed from x (the tail) to y (the head – the arrow: ->).

Weighted Graph is a graph in which a number (the weight) is assigned to each edge. Such weights might represent for example costs, lengths or capacities, depending on the problem at hand.

In our task we need to represent a directed and weighted graphs and run on them some graph's algorithms problems in programming (such as tsp, finding the shortest path from one vertex to another, etc..) + a visual design of the graph.

For more information about graph: Graph