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 'Value of intuitionistic logic'

I'm taking a look at intuitionistic propositional logic (IPL). Basically it exclude Double Negation Elimination (DNE) from the set of axiom schemas replacing it with Ex falso quodlibet: ⊥ → p for any proposition p (including both atomic and composite propositions). In IPL, for instance, the Law of Excluded Middle (LEM) p ∨ ¬p is no longer a theorem. My question: aside from the logic formal perspective, is IPL supposed to model/address some specific "kind of world" ? Thanks.
View full post »

Thread 'Formal derivation of statement from Peano Arithmetic system'

I was reading a Bachelor thesis on Peano Arithmetic (PA). PA has the following axioms (not including the induction schema): $$\begin{align} & (A1) ~~~~ \forall x \neg (x + 1 = 0) \nonumber \\ & (A2) ~~~~ \forall xy (x + 1 =y + 1 \to x = y) \nonumber \\ & (A3) ~~~~ \forall x (x + 0 = x) \nonumber \\ & (A4) ~~~~ \forall xy (x + (y +1) = (x + y ) + 1) \nonumber \\ & (A5) ~~~~ \forall x (x \cdot 0 = 0) \nonumber \\ & (A6) ~~~~ \forall xy (x \cdot (y + 1) = (x \cdot y) + x) \nonumber...
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