[SANDBOX-351] Provide Strongly Connected Components algorithms implementation

• Type: New Feature
• Status: Open
• Priority: Major
• Resolution: Unresolved
• Component/s: Graph
• Assignee: Unassigned
• Reporter: Simone Tripodi
• Created: 20/Dec/11 09:22
• Updated: 20/Dec/11 16:27

Description

Right now, the org.apache.commons.graph.ssc package contains empty implementations of Strongly Connected Components algorithms

Sub-Tasks

• Provide Cheriyan-Mehlhorn/Gabow's strongly connected component algorithm implementation: Resolved
• Provide a Kosaraju-Sharir's algorithm implementation: Resolved
• Provide a Tarjan's algorithm implementation: Resolved