Documentation
¶
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type KosarajuSharirSCC ¶
type KosarajuSharirSCC struct {
// contains filtered or unexported fields
}
func NewKosarajuSharirSCC ¶
func NewKosarajuSharirSCC(g *directed_graph.Digraph) *KosarajuSharirSCC
func (*KosarajuSharirSCC) Count ¶
func (scc *KosarajuSharirSCC) Count() int
func (*KosarajuSharirSCC) Id ¶
func (scc *KosarajuSharirSCC) Id(v int) int
func (*KosarajuSharirSCC) StronglyConnected ¶
func (scc *KosarajuSharirSCC) StronglyConnected(v, w int) bool
StronglyConnected finds out wheter to vertices are strongly connected. Two vertices are strongly connected, if and only if there is a directed path from v to w and vice versa
Source Files
Click to show internal directories.
Click to hide internal directories.