메소드 | 설명 | |
---|---|---|
GetEdge ( int scc, int ind ) : |
||
GetEdge ( int strongConnectedComponent, int edgeIndex ) : DirectedEdge | ||
GetStrongConnectedComponentEdgesCount ( int strongConnectedComponent ) : int | ||
GetStrongConnegtionComponentVerticesCount ( int strongConnectedComponent ) : int | ||
GetVertex ( int strongConnectedComponent, int vertexIndex ) : int | ||
IsStrongConnected ( int vertex1, int vertex2 ) : bool | ||
KosarajuAlgorithm ( ) : System | ||
KosarajuAlgorithm ( |
||
KosarajuAlgorithm ( DirectedGraph Graph ) : System | ||
SCCEdgCount ( int scc ) : int | ||
SCCVrtxCount ( int scc ) : int | ||
StrongConnect ( int v1, int v2 ) : bool |
메소드 | 설명 | |
---|---|---|
AddSCC ( int v, int &mark, |
||
AddStrongConnectedComponent ( int vertex, int mark, DirectedGraph Graph ) : void | ||
BuildStrongConnectedComponents ( DirectedGraph Graph ) : void |
public GetEdge ( int strongConnectedComponent, int edgeIndex ) : DirectedEdge | ||
strongConnectedComponent | int | |
edgeIndex | int | |
리턴 | DirectedEdge |
public GetStrongConnectedComponentEdgesCount ( int strongConnectedComponent ) : int | ||
strongConnectedComponent | int | |
리턴 | int |
public GetStrongConnegtionComponentVerticesCount ( int strongConnectedComponent ) : int | ||
strongConnectedComponent | int | |
리턴 | int |
public GetVertex ( int strongConnectedComponent, int vertexIndex ) : int | ||
strongConnectedComponent | int | |
vertexIndex | int | |
리턴 | int |
public IsStrongConnected ( int vertex1, int vertex2 ) : bool | ||
vertex1 | int | |
vertex2 | int | |
리턴 | bool |
public KosarajuAlgorithm ( |
||
G | ||
리턴 | System |
public KosarajuAlgorithm ( DirectedGraph Graph ) : System | ||
Graph | DirectedGraph | |
리턴 | System |