https://github.com/qequ/graphs_discrete2

A project that suites a set of greedy graph coloring, orders for greedy & bipartite checking algorithms
https://github.com/qequ/graphs_discrete2

Last synced: 12 months ago
JSON representation

A project that suites a set of greedy graph coloring, orders for greedy & bipartite checking algorithms

• Host: GitHub
• URL: https://github.com/qequ/graphs_discrete2
• Owner: qequ
• License: mit
• Created: 2019-08-28T19:25:08.000Z (almost 7 years ago)
• Default Branch: master
• Last Pushed: 2019-08-28T19:50:51.000Z (almost 7 years ago)
• Last Synced: 2024-10-12T00:44:56.981Z (over 1 year ago)
• Language: C
• Homepage:
• Size: 61.5 KB
• Stars: 1
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# Discrete Maths course project

A set of algorithms for greedy coloring graphs.

It uses as input the DIMACS format and we have implemented our own graph & vertice data structures


## Main Algorithms

### Greedy coloring graph

Classic implementation of the algorithm for coloring a graph with the 

greedy heuristic


### Bipartite checking algorithm

Algorithm for checking if the given graph is bipartite. If not, color it with the greedy algorithm


### Different orders for vertices

Useful functions for order vertices accord to different principles;




    
ordering vertices given their names in natural order

    
Welsh-Powell order, i.e. ordering vertices in decreasing order of grade

    
RMBC

    
Others




> The most part of the code is written in spanish.