Main repository of SageMath

Collection of algorithm implementations from various sources plus own creations.

Python implementation of graphs.

General purpose mathematical software system, compatible fork of https://github.com/sagemath/sage supporting modularized installation with pip. Main repository, containing Sage library (src/), modu…

Visualise networks and trees in Python, with style.

Automagic Python Bindings for the Open Graph Drawing Framework

Code from the book "Graph Algorithms the Fun Way" by Jeremy Kubica

An open textbook for Discrete Mathematics with SageMath, as taught at the City Colleges of Chicago

Hamiltonian path and cycle finder.

supplemental data for "Using SAT to study plane Hamiltonian substructures in simple drawings"

An algorithm that finds a hamiltonian path (if one exists) in undirected connected graphs, using knowledge about articulation points to significantly speed up the process of finding a hamiltonian path

All Algorithms implemented in Python

Code related to the paper "A first view on the density of 5-planar graphs"

Finding Hamiltonian Paths of a graph data structure

Python implementation of graphs.