Collection of various algorithms in mathematics, machine learning, computer science, physics, etc implemented in C for educational purposes.

Library for the analysis of networks

Supernodal sparse direct solver. https://portal.nersc.gov/project/sparse/superlu/

Planar graph algorithms

中国大学MOOC-浙江大学-翁恺老师网课-C语言程序设计，我从零开始自学编程的记录。

Implementation of multiple-source maximum-flow algorithm for planar graphs described by Borradaile, et. al (2011)

Practical algorithm for calculating the genus of a graph

A Hamiltonian path or traceable path is a path that visits each vertex exactly once. A graph that contains a Hamiltonian path is called a traceable graph. A graph is Hamiltonian-connected if for ev…

Code to list all edge-critical graphs of a given size and chromatic number.

Supplemental programs for use with nauty and other graph software.

A plugin for the utility program geng provided with Nauty that enables quick generation of nonisomorphic sparse and tight graphs.

Code and data for finding graphs of large size with a minimum girth

A generator for K2-hypohamiltonian graphs created for the article "J. Goedgebeur, J. Renders and C. T. Zamfirescu. Generation and New Infinite Families of K2-hypohamiltonian Graphs, manuscript".

This repository contains code and data related to the paper "On vertex-girth-regular graphs: (Non-)existence, bounds and enumeration"

This repository contains four programs which were created for the article "J. Goedgebeur, J. Renders, G. Wiener and C.T. Zamfirescu, K2-Hamiltonian Graphs: II, manuscript", as well as some certific…

A git repository to find all hamiltonian cycles on chordal graphs.

This repository contains code and data related to the paper "Exhaustive generation of edge-girth-regular graphs"

Computational methods for finding bi-regular graphs of given girth