Hello,
I need to create an software which analyzes these two algorithms.
Maybe anyone knows where I can find RLF and DSATUR algo pseudocode? or
full description.
I can't find nothing about DSATUR algo.
for RLF I try to implement this algo:
> procedure ColorByRLF();
> var
> clr : integer ;
> i, v : integer ;
> begin
> clr := 0;
> while (IsLeftUncolored) do
> begin
> MakeUncoloredListL();
> while not isL_empty() do
> begin
> v := WhichVertexHaveLargerstNumberOfUncoloredNeighbors();
> if v = -1 then break;
> Graph[v].Color := color[clr];
> Graph[v].colored := true;
> RemoveVfromL(v);
> end;
> inc(clr);
> end;
> end;
>
but seems it doesn't works properly.
--
You can contact me by :
Home page: http://www.revidev.com/halfas/
Blog: http://www.revidev.com/halfas/blog
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
