Versions in this module Expand all Collapse all v0 v0.2.7 Sep 7, 2026 v0.2.6 Sep 5, 2026 v0.2.5 Aug 27, 2026 v0.2.4 Aug 15, 2026 v0.2.3 Aug 15, 2026 Changes in this version type ChainFinder + func (f *ChainFinder) LongestChains(ctx context.Context, limit int) ([][]string, error) v0.2.2 Aug 12, 2026 Changes in this version + func StronglyConnectedComponents(g DirectedGraph) [][]string + type ChainFinder struct + func NewChainFinder(g DirectedGraph) *ChainFinder + func (f *ChainFinder) LongestChain() []string + func (f *ChainFinder) LongestChainFrom(nodeID string) []string v0.2.1 Jul 18, 2026 v0.2.0 Jul 12, 2026 Changes in this version + func ComputeCouplingMetrics(g DirectedGraph, config CouplingConfig) (map[string]*CouplingMetrics, error) + type CouplingConfig struct + AbstractnessFunc func(nodeID string) (float64, error) + type CouplingMetrics struct + Abstractness float64 + Ca int + Ce int + Distance float64 + Instability float64 + NodeID string + type CycleDetector struct + func NewCycleDetector() *CycleDetector + func (d *CycleDetector) DetectCycles(g DirectedGraph) *CycleResult + type CycleResult struct + AffectedNodes map[string]bool + Cycles [][]string + HasCycles bool + type DirectedGraph interface + HasNode func(nodeID string) bool + NodeCount func() int + NodeIDs func() []string + Predecessors func(nodeID string) []string + Successors func(nodeID string) []string + type MapGraph struct + func NewMapGraph() *MapGraph + func (g *MapGraph) AddEdge(from, to string) + func (g *MapGraph) AddNode(id string) + func (g *MapGraph) HasNode(nodeID string) bool + func (g *MapGraph) NodeCount() int + func (g *MapGraph) NodeIDs() []string + func (g *MapGraph) Predecessors(nodeID string) []string + func (g *MapGraph) Successors(nodeID string) []string
Go to main page