Skip to content

A computational implementation of finite graph algorithms and its solution to the maximum flow problem (using the Ford-Fulkerson method)

License

Notifications You must be signed in to change notification settings

renanbaqui/graphy

Repository files navigation

Graphy License GitHub

Graphy is a computational implementation of finite graph algorithms (represented separately in an adjacency matrix and adjacency list) and it also provides a solution to the maximum flow problem (using the Ford-Fulkerson method), mostly written in C language.

Installation

Compile lista.c or matriz.c with GCC and execute.

Contributing

Pull requests are welcome.

License

Apache License 2.0

About

A computational implementation of finite graph algorithms and its solution to the maximum flow problem (using the Ford-Fulkerson method)

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published