b.gif
b.gif
I don't know why writing this article.
Several days ago, Mrs Yee told us that traslations  would be replaced by writing, hoo,hoo,this is a practice in some way.
When I was faced with the problem which was about Euler graph afternoon, at first I was so excited about it ,all reasons were I had just make it out, conversely ,I didn't. I was wrong.
In Discrete Mathematic ,we can solve the Chinese postman's problem with it ,what's more it is used in many princedoms ,such as Computer Science,Electric Science,OperationsResearch,etc..
Now I will describe it in my own words:
1.  pick any vertex to start
2.  from that vertex pick an edge to traverse (see below for important rule)
3.  darken that edge, as a reminder that you can't traverse it again
4.  travel that edge, coming to the next vertex
5.  repeat 2-4 until all edges have been traversed, and you are back at the starting vertex
at each stage of the algorithm:
  • the original graph minus the darkened (already used) edges = reduced graph
  • important rule: never cross a bridge of the reduced graph unless there is no other choice
  • why must we observe that rule?
OK ,suddenly I have the Euler's path in mind.
the same algorithm works for Euler paths.
before starting, use Euler’s theorems to check that the graph has an Euler path and/or circuit to find!
when we do this on paper, we can erase each edge as we traverse it .
this will make the reduced graph visible, and its bridges apparent .
**************************************************************************************************************
That's all what I wanna say.
May this be useful for you.     Thank you.
                                                                                Jeick Jia
                                 School of Computer Science in Sichuan University