Library for the analysis of networks

Isomorphism testing and automorphisms of graphs

Algorithm project solving a maximum flow problem

A library to simulate DFAs and Probabilistic DFAs using context switching. This library provides a way to build and define the behavior of a graph. The client is able to define the function each vertex and edge of the graph make and how the graph transitions from one (the first valid edge) or to many states, as well as which states the graph sta…

The Chemical and abstract Graph environment

igraph sugiyama graph layout algorithm in C

Breadth First Search implementation on Bipartite Undirected Graph.

An algorithm to look for maximum "edge" biclique

C based Graph Theory Library

Python interface to the motif counting algorithms mfinder, fanmod, pgd, NetMODE

Algorithmes de parcours de graphe et de gestion de flots.

Program an ant colony manager to help them cross a graph in as few strokes as possible, the result can be displayed with a visualizer 🐜🐜🐜

directed graph layout program with GTK+ gui for gml or graphviz files doing sugiyama layout

algorithmic project about a maximum flow problem in graph theory

An implementation of an hypergraph in C

Cubic graph enumeration project based on "Fast generation of cubic graphs" paper.

DARPA UHPC Graph Theory Benchmark (Scalable Synthetic Compact Application #2)

Graph implementation and algorithms

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

O trabalho visa treinar um modelo que separe bases de dados em grupos, utilizando grafos.