MHB Fleury's Algorithm: Finding Next Edge

  • Thread starter Thread starter Joystar77
  • Start date Start date
  • Tags Tags
    Algorithm
AI Thread Summary
Fleury's Algorithm is applied to determine the next edge to travel from a specific vertex in a graph after three edges have been deleted. The discussion emphasizes the importance of identifying all possible edges that can be traversed next from the starred vertex. Participants highlight the need for clarity in graph representation, as the absence of visual aids and context for the vertex labels can lead to confusion. The focus remains on ensuring that the algorithm is correctly implemented to find valid paths. Overall, understanding the graph's structure is crucial for effectively using Fleury's Algorithm.
Joystar77
Messages
122
Reaction score
0
Using Fleury’s Algorithm in the graph to the bottom left, I deleted three edges and I got the graph to the bottom right. If I am currently at the starred vertex, list all possibilities for the edge I should travel next.

A B Left graph
3

2
C D
1E F

A
B

Right graph

C D

E F
 
Physics news on Phys.org
You did not include pictures of the graph. Also, the letters (A, B, E, F, etc.) that follow the first paragraph don't make sense without a context.
 

Thread 'Deductive proof in logic formal systems'

I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
View full post »

Similar threads

MHB Find total number of republications
Replies
22
Views
2K
Combinatorial Algorithm for Sorting Adjacency Matrices in Polynomial Time
Replies
4
Views
2K
Comp Sci Using Single Source Shortest Path Algorithm to find the longest path
Replies
4
Views
2K
MHB Finding a Minimal Vertex Cover & Max Sets for a Graph
Replies
2
Views
2K
MHB Analyzing Depth-first Search Edge Types
Replies
2
Views
2K
MHB What are the best algorithms for solving a TSP with 6 points?
Replies
2
Views
2K
MHB Problem on Graph Theory and Algorithms
Replies
2
Views
3K
MHB Finding Shortest Path in G: Dijkstra's Algorithm
Replies
2
Views
2K
MHB Prim's algorithm-Minimum Spanning Tree
Replies
8
Views
2K
MHB Is HSC NP-Complete in Graph Theory?
Replies
1
Views
2K

Hot Threads

Recent Insights

Back
Top