Algorithm: Three of the following algorithms must be used to solve the problem.

Dijkstra Algorithm

Bellman$-$Ford Algorithm

A$*$ Algorithm

Flody$-$Warshall Algorithm

Additional points will be awarded for solving the problem with any of the meta$-$heuristic algorithms specified. $($extra $10$ points$)$

Simulated Annealing Algorithm

Tabu Search Algorithm

Ant Colony Algorithm

Bee Colony Algorithm

Firefly Algorithm

Explanation :

First, you should read the input file and take the parts suitable for the constraint you will use.

Then, you need to send the parameters to the method according to your request and find the path that provides the necessary constraints. If you want to find a solution for more than one constraint, you must make sure that the path found satisfies all constraints.

Each method should be written in separate methods. If you are making a solution with multiple parameters, you need to individually specify methods for each one.

Output: After running the algorithm, it should give all nodes in the calculated path.

The problem should find a solution according to the objective function given below.

min$(bw{\displaystyle \underset{\text{i}\text{j}\text{i}\text{n}\text{E}}{\overset{?}{}}}{}_{ij}dis{t}_{ij})$

In the given equation:

Graph $($G$)$ consists of vertex and edges, $G=(V,E).$ i and $j$ are two vertices defined in the graph and ij denotes an edge in the edge set.

bw represents bandwidth demand,

${}_{ij}=\{\begin{array}{ccc}1,& if\text{e}\text{d}\text{g}\text{e}(i,j)is\text{u}\text{s}\text{e}\text{d}& \\ 0,& \text{o}\text{t}\text{h}\text{e}\text{r}\text{w}\text{i}\text{s}\text{e}& \end{array}$

dist ${?}_{ij},$ edge distances between i and $j.$