Yesterday I finished my discrete mathematics term paper, it was about comparing two heuristics graph coloring algorithms, it’s RLF [Recursive Largest First] and DSATUR - named because of it’s saturation degree. It’s was pretty fun programming 
My findings was that RLF algo works faster, and kinda better.
h ere you can see a screenshoot:
No comments:
Post a Comment