Weakly connected Graph?
From the Wikipedia page:
"A directed graph is called weakly connected if replacing all of its
directed edges with undirected edges produces a connected (undirected)
graph"
Is this accurate?
The above graph is connected when all directed edges are replaced with
undirected edges.But there is no path between B to D or D to B which
violates the weakly typed property..Am i right?
No comments:
Post a Comment