Map coloring, using four colors

Implementation of Planar Graph Convolutional Networks in TensorFlow

Several different implementations of the A-Star algorithm, including a Bidirectional version.

A simple and small .NET library for computational planar geometry.

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

Implementation of the BasePlanE models and the experiments from the NeurIPS 2023 paper "PlanE: Representation Learning over Planar Graphs"

A little helper to complete homework #4 "Graph planarization" in discrete mathematics at ITMO University in the second semester.

Laboratory problems and solutions for the ITMO course "Discrete Mathematics".

This repository contains an ulta-fast Python implementation of the Triangulated Maximally filtered Graph (TMFG).

A set of tools to perform calculations with trivalent diagrams in Mathematica

Algorithms and data structures for PTAS (Polynomial Time Approximation Scheme) on planar graphs

Five-coloring planar graphs http://harrisonrbrown.com/slick-mongoose

Different implementations of the Dijkstra Shortest Paths algorithm, including a Bidirectional version.

Discrete Mathematics course at ITMO University

Inoffizielles Skript für die Vorlesung „Algorithmen für planare Graphen“ von Prof. Dr. Dorothea Wagner

Preparatory work for Master Thesis 2017-2018 (Characterization and Complexity of Thin Strip Graphs)

🎓 Обучающая программная система по теории планарных графов.

This repository contains the code for the lab session of the course Graph Theory.

Extension of My-Project that displays the appropriate message if the graph is planar or not

short C++ graph/computational geometry algorthim for finding the faces of a planar graph given its vertices and edges.