This is the pratical project of Design Analysis of Algorithm discipline from Federal University of Lavras (UFLA), developed by Lucas Fonseca dos Santos and Marco Aurelio Ferreira de Sousa that implements the Depth first search DFS, topological ordering, bellman ford algorithms and a Graph data structure. It's able to receives a input data file and processing the operations listed there.

coming soon

• Shell Bash
• Java Virtual Machine

In first step, enter the directory:

$ cd Pratical-Project-Algorithms-in-Graph/

Continuing then

$ sudo chmod +x init.sh
$ ./init.sh <input_file_path>

The input data file follows the following formalism:

<identifier>:
X1
.
.
.
Xn

where (x1,...,xn) are arguments. The possible identifiers are:

Vertexes:
Searchs:
Shortests:
Edges:

The vertexes, searchs and shortests set can be represented by any way, as:

Vertexes:
A
InitialVertex
1
001

But the edges set, follows the next formalism:

x0->xk(n)

Where x0 is u, xk is v and n is weight value, for u,v ∈ E.

• Lucas Fonseca dos Santos - Computer Science student of Federal University of Lavras - [email protected]
• Marco Aurelio Ferreira de Sousa - Computer Science student of Federal University of Lavras

This project is licensed under no license. Copyleft is freedom!