Opened 12 years ago

Closed 12 years ago

#4292 closed Feature Requests (invalid)

Planar graph coloring algorithm

Reported by: Mike Douglass Owned by: Jeremiah Willcock
Milestone: Boost 1.43.0 Component: graph
Version: Boost 1.42.0 Severity: Not Applicable
Keywords: Planar coloring algorithm Cc: jewillco@…

Description

A simple alternating chain algorithm for four coloring planar graphs. The algorithm is based on an ordering principal.

Attachments (4)

article.pdf​ (48.6 KB ) - added by Mike Douglass 12 years ago.
Explanation of the algorithm
pl.cpp​ (5.9 KB ) - added by Mike Douglass 12 years ago.
principal file
Declarations.cpp​ (2.5 KB ) - added by Mike Douglass 12 years ago.
Definitions and Declarations
pl.2.cpp​ (12.3 KB ) - added by Mike Douglass 12 years ago.
pl.cpp with comments

Download all attachments as: .zip

Change History (6)

by Mike Douglass, 12 years ago

Attachment: article.pdf​ added

Explanation of the algorithm

by Mike Douglass, 12 years ago

Attachment: pl.cpp​ added

principal file

by Mike Douglass, 12 years ago

Attachment: Declarations.cpp​ added

Definitions and Declarations

comment:1 by Jeremiah Willcock, 12 years ago

Component: None → graph
Owner: set to Jeremiah Willcock

by Mike Douglass, 12 years ago

Attachment: pl.2.cpp​ added

pl.cpp with comments

comment:2 by Jeremiah Willcock, 12 years ago

Resolution: → invalid
Status: new → closed

Although I appreciate the algorithm submission, it would take a lot of work to make this code generic to the level required to add it to Boost.Graph. I can provide guidance if you wish to do that, though.

Note: See TracTickets for help on using tickets.