Use Fleury's Algorithm to find an Euler path through the graph using this new edge by listing the vertices in the order visited is; G-H-L-K-G-J-I-G
A quick examination of the given graph tells us that two of the seven vertices (G, I) have an odd number of edges while the other five (F, H, J, K, L) have an even number. Since every vertex must have an even number of attached edges for us to possibly construct an Eulerian circuit, our first step is necessary to add an edge connecting G to I.
A somewhat easy way to now construct an Eulerian circuit would be to take our original graph (i.e. without the G-I edge) and find an Eulerian path from D to H, then end by taking our added D-H edge back to D.
The way to find Fleury's Algorithm, is that;
1) Start with classifying the vertices of the given graph as odd and even. If there are 0 or 2 odd vertices, then continue with the algorithm.
2) Begin with any one of the odd vertices, if they exist, otherwise arbitrarily choose a vertex as the starting point.
3) Travel every edge exactly once such that the bridges in the graph are travelled at the end.
4) Stop when all the edges are travelled.
Read more about Euler's Path at; brainly.com/question/11598226
#SPJ1
