INE5413 Assignment: Graph Theory

Available algorithms:

• Undirected Graph:

  Breadth First Search, Hierlholzer, Bellman Ford, Floyd Warshall, Prim.
  

• Directed Graph:

  Strongly Connected, Topological Sorting. 
  

• Bipartite Graph:

  Hopcroft Karp.
  

Usage

Positional arguments:

id           set graph identification
dataset      set input data

Optional arguments:

-h, --help   show help message and exit
--digraph    set graph as digraph (default is undigraph)
--arcs       set file separator as *arcs (default is *edges)
--bipartite  set graph as a bipartite graph (it's a undigraph)

Example:

app.py 1 datasets/contem_ciclo.txt
    or
app.py 1 datasets/dirigido1.txt --digraph --arcs
    or
app.py 1 datasets/pequeno.txt --bipartite