Skip Menu |

This queue is for tickets about the Graph CPAN distribution.

Report information
The Basics
Id: 42549
Status: resolved
Priority: 0/
Queue: Graph

People
Owner: Nobody in particular
Requestors: miranska [...] yahoo.com
Cc:
AdminCc:

Bug Information
Severity: (no value)
Broken in: (no value)
Fixed in: (no value)



Subject: stron
Hi, I am not sure if it is a bug or a feature... When I run my $g = Graph::Directed->new; $g->add_edges( ['a', 'b'], ['b', 'a'], ['b', 'c'] ); my @scc = $g->strongly_connected_components(); I expect to see only one strongly connected component containing 'a' and 'b'. However, the system also show the second component containing 'c' even though 'c'-'c' edge is not present. I can always filter these components out by using $g->has_edge( 'c', 'c')"
Subject: strongly_connected_component output
Sorry, accidentally submitted the report before completion and cannot delete it now... As a continuation of the last message -- I am not sure if the 2nd ("c") component should appear, assuming the definition of strongly connected component in the Wikipedia is correct: "A directed graph is called strongly connected if there is a path from each vertex in the graph to every other vertex." [http://en.wikipedia.org/wiki/Strongly_connected_component]
Working as intended, sorry. The definitions of strongly connected components one can finf from different sources are not identical: sometimes the "reachable" requires a directed edge, sometimes not. I chose the latter and it cannot be changed without breaking people's existing code/data.