0
我的意思是有向圖可以有自我循環,所以我沒有看到無向圖無法擁有它的原因(CLRS說它沒有提供有效的理由就被禁止)。有沒有自循環的無向圖?
Example:
G_directed = (V,E) is a directed graph
Say this graph has the vertex set V = {1,2,3,4,5,6}
With edges E = {(1,2),(2,2),(2,4),(2,5),(4,1),(4,5),(5,4),(6,3)}
-----------------------------------------------------------------
Say we now decide to turn G_directed into an undirected graph:
G_undirected = (Vu,Eu) is an undirected graph
Vu = {1,2,3,4,5,6}
With edges E = {(1,2),(2,2),(2,4),(2,5),(4,1),(4,5),(6,3)}
在該示例中(2,2)是自循環。我認真看不到任何圖形遍歷的問題。
您有問題要問?根據定義,無向圖中的每條邊都會生成一個循環。所以,對於無向圖中循環的討論,我應該說,不像有向圖中循環的討論那樣發展。 –