471,853 Members | 1,869 Online
Bytes | Software Development & Data Engineering Community
Post +

Home Posts Topics Members FAQ

Join Bytes to post your question to a community of 471,853 software developers and data experts.

HELP ME! - Colored graph problem

I need to write a program with content:
Colored plane graphs. Tell people what I know. I always code for the study.
please send me mail: khacthuy.3k@gmail.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.
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 1781
Please help me! HELP HELP
Oct 18 '09 #2
9,065 Expert Mod 8TB
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

Post your reply

Sign in to post your reply or Sign up for a free account.

Similar topics

5 posts views Thread by Herman | last post: by
3 posts views Thread by Robert Dell | last post: by
1 post views Thread by entropy123 | last post: by
reply views Thread by NeoPa | last post: by
reply views Thread by YellowAndGreen | last post: by
reply views Thread by aboka | last post: by

By using Bytes.com and it's services, you agree to our Privacy Policy and Terms of Use.

To disable or enable advertisements and analytics tracking please visit the manage ads & tracking page.