Map coloring, using four colors
-
Updated
Dec 15, 2023 - Python
Map coloring, using four colors
Implementation of Planar Graph Convolutional Networks in TensorFlow
Given a planar, undirected, graph enumerate all of the faces of the graph. Can also be described as finding all of the polygons within the graph, or the minimum cycle basis, based on Geometric Tools C++ Library
Inoffizielles Skript für die Vorlesung „Algorithmen für planare Graphen“ von Prof. Dr. Dorothea Wagner
This repository contains an ulta-fast Python implementation of the Triangulated Maximally filtered Graph (TMFG).
Several different implementations of the A-Star algorithm, including a Bidirectional version.
Different implementations of the Dijkstra Shortest Paths algorithm, including a Bidirectional version.
Discrete Mathematics course at ITMO University
Five-coloring planar graphs http://harrisonrbrown.com/slick-mongoose
Implementation of the BasePlanE models and the experiments from the NeurIPS 2023 paper "PlanE: Representation Learning over Planar Graphs"
A simple and small .NET library for computational planar geometry.
Fork of the LEMON C++ Graph Library
A learning website about planar graphs.
tsa + graph -> visibility graph
Cycle-Detection: A Parallel Algorithm for Cycle Detection in Planar Partitioned Digraphs
Preparatory work for Master Thesis 2017-2018 (Characterization and Complexity of Thin Strip Graphs)
Laboratory problems and solutions for the ITMO course "Discrete Mathematics".
🎓 Обучающая программная система по теории планарных графов.
A set of tools to perform calculations with trivalent diagrams in Mathematica
This repository contains the code for the lab session of the course Graph Theory.
Add a description, image, and links to the planar-graphs topic page so that developers can more easily learn about it.
To associate your repository with the planar-graphs topic, visit your repo's landing page and select "manage topics."