473,700 Members | 2,608 Online

# HELP ME! - Colored graph problem

2 New Member
I need to write a program with content:
Colored plane graphs. Tell people what I know. I always code for the study.
Thanks
please send me mail: khacthuy.3k@gma il.com
I come from VietNamese
-----------------------------------------------------------------
Algorithm colored graphs
Input: graph G = (V, E).
Output: graph G = (V, E) is the peak has been assigned color.
Steps:
1 / Make a list of the top of the graph E ': = [v1, v2, ..., vn] is arranged in order bacgiam order: d (v1) ≥ d (v2) ≥ ... ≥ d (vn)
Set i: = 1;
2 / Highlight the top of the first i in the list. Browse the top of the next turn and shown for the top i do not have adjacent vertices colored i.
3 / If all the vertices have been shown the end, the graph shown in i color. Conversely, to step 4
4 / remove from E 'was the top highlight. Rearrange the vertices in E 'in order of descending rank.
Set i: = i + 1 and return to step 2
Oct 17 '09 #1
2 1908
khacthuy
2 New Member
Oct 18 '09 #2
Banfa
9,065 Recognized Expert Moderator Expert
On this forum if you want help you are going to have to show some evidence of having attempted your problem yourself.

We will help you with the problems you are having writing your code, not write your code for you.
Oct 18 '09 #3