https://github.com/juliagraphs/graphscoloring.jl

A Julia package implementing greedy, DSATUR (Degree SATURated), and workstream graph coloring algorithms for efficient graph coloring.
https://github.com/juliagraphs/graphscoloring.jl

boundary-element-method coloring-al coloring-graph graphs multithreading

Last synced: 7 months ago
JSON representation

A Julia package implementing greedy, DSATUR (Degree SATURated), and workstream graph coloring algorithms for efficient graph coloring.

• Host: GitHub
• URL: https://github.com/juliagraphs/graphscoloring.jl
• Owner: JuliaGraphs
• License: mit
• Created: 2025-07-11T11:14:06.000Z (11 months ago)
• Default Branch: main
• Last Pushed: 2025-09-29T08:00:12.000Z (8 months ago)
• Last Synced: 2025-10-05T08:52:10.632Z (8 months ago)
• Topics: boundary-element-method, coloring-al, coloring-graph, graphs, multithreading
• Language: Julia
• Homepage: https://juliagraphs.org/GraphsColoring.jl/
• Size: 3.08 MB
• Stars: 3
• Watchers: 0
• Forks: 0
• Open Issues: 1
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# GraphsColoring



  

  



[![Stable](https://img.shields.io/badge/docs-stable-blue.svg)](https://juliagraphs.org/GraphsColoring.jl/stable/)

[![Dev](https://img.shields.io/badge/docs-dev-blue.svg)](https://juliagraphs.org/GraphsColoring.jl/dev/)

[![Build Status](https://github.com/JuliaGraphs/GraphsColoring.jl/actions/workflows/CI.yml/badge.svg?branch=main)](https://github.com/JuliaGraphs/GraphsColoring.jl/actions/workflows/CI.yml?query=branch%3Amain)

[![Coverage](https://codecov.io/github/JuliaGraphs/GraphsColoring.jl/coverage.svg?branch=main)](https://codecov.io/github/JuliaGraphs/GraphsColoring.jl?branch=main)

[![Aqua QA](https://raw.githubusercontent.com/JuliaTesting/Aqua.jl/master/badge.svg)](https://github.com/JuliaTesting/Aqua.jl)

## Introduction

Graph coloring is a technique used to avoid conflicts between elements in a graph. The goal is to assign colors to the elements such that no two neighboring elements have the same color.

Currently, the following aspects are implemented (✓) and planned (⌛):

- ✓ [Greedy](https://www.geeksforgeeks.org/dsa/graph-coloring-set-2-greedy-algorithm/)

- ✓ [DSATUR (Degree SATURated)](https://www.geeksforgeeks.org/dsa/dsatur-algorithm-for-graph-coloring/)

- ✓ [Workstream](https://dl.acm.org/doi/10.1145/2851488)

- ⌛ Random (and iterative random coloring)

- ⌛ First-Fit Coloring

## Documentation

- Documentation for the [latest stable version](https://juliagraphs.org/GraphsColoring.jl/stable/).

- Documentation for the [development version](https://juliagraphs.org/GraphsColoring.jl/dev/)