graph

type AlgorithmError struct {
	Algorithm string
	Operation string
	Err       error
}

type Dominators struct {
	// contains filtered or unexported fields
}

type DominatorsConfig struct {
	// MaxNodes limits the number of nodes to process.
	MaxNodes int

	// Timeout is the maximum execution time.
	Timeout time.Duration

	// ProgressInterval is how often to report progress.
	ProgressInterval time.Duration
}

type DominatorsInput struct {
	// Entry is the entry node of the graph.
	Entry string

	// Nodes is the list of all node IDs.
	Nodes []string

	// Successors maps each node to its successors.
	Successors map[string][]string

	// Source indicates where the request originated.
	Source crs.SignalSource
}

type DominatorsOutput struct {
	// IDom maps each node to its immediate dominator.
	// The entry node has no immediate dominator.
	IDom map[string]string

	// DominatorTree maps each node to its children in the dominator tree.
	DominatorTree map[string][]string

	// DominanceFrontier maps each node to its dominance frontier.
	DominanceFrontier map[string][]string

	// DFSOrder is the nodes in DFS pre-order.
	DFSOrder []string

	// NodesReachable is the number of nodes reachable from entry.
	NodesReachable int

	// TreeDepth is the maximum depth of the dominator tree.
	TreeDepth int
}

type TarjanConfig struct {
	// MaxNodes limits the number of nodes to process.
	MaxNodes int

	// Timeout is the maximum execution time.
	Timeout time.Duration

	// ProgressInterval is how often to report progress.
	ProgressInterval time.Duration
}

type TarjanInput struct {
	// Nodes is the list of node IDs in the graph.
	Nodes []string

	// Edges maps each node to its outgoing edges (adjacency list).
	Edges map[string][]string

	// Source indicates where the request originated.
	Source crs.SignalSource
}

type TarjanOutput struct {
	// SCCs is the list of strongly connected components.
	// Each SCC is a list of node IDs.
	SCCs [][]string

	// NodeToSCC maps each node to its SCC index.
	NodeToSCC map[string]int

	// Cyclic is true if any SCC has more than one node.
	Cyclic bool

	// LargestSCCSize is the size of the largest SCC.
	LargestSCCSize int

	// NodesProcessed is the number of nodes visited.
	NodesProcessed int

	// TopologicalOrder is the SCCs in reverse topological order.
	// (each SCC can be treated as a single node in the DAG)
	TopologicalOrder []int
}

type TarjanSCC struct {
	// contains filtered or unexported fields
}

type VF2 struct {
	// contains filtered or unexported fields
}

type VF2Config struct {
	// MaxMatches limits the number of matches to find.
	// Set to 0 for unlimited (find all matches).
	MaxMatches int

	// MaxIterations limits the search iterations.
	MaxIterations int

	// Timeout is the maximum execution time.
	Timeout time.Duration

	// ProgressInterval is how often to report progress.
	ProgressInterval time.Duration
}

type VF2Graph struct {
	// Nodes is the list of node IDs.
	Nodes []string

	// Edges maps each node to its outgoing edges.
	Edges map[string][]string

	// NodeLabels maps node IDs to their labels (for semantic matching).
	NodeLabels map[string]string
}

type VF2Input struct {
	// Pattern is the smaller graph to find.
	Pattern VF2Graph

	// Target is the larger graph to search in.
	Target VF2Graph

	// NodeMatcher is an optional function to check node compatibility.
	// If nil, all nodes are considered compatible.
	NodeMatcher func(patternNode, targetNode string, patternLabels, targetLabels map[string]string) bool

	// Source indicates where the request originated.
	Source crs.SignalSource
}

type VF2Output struct {
	// IsIsomorphic is true if at least one match was found.
	IsIsomorphic bool

	// Matches is the list of found isomorphisms.
	// Each match maps pattern node IDs to target node IDs.
	Matches []map[string]string

	// MatchCount is the total number of matches found.
	MatchCount int

	// IterationsUsed is the number of search iterations.
	IterationsUsed int

	// PrunedStates is the number of states pruned by feasibility rules.
	PrunedStates int

	// SearchComplete is true if the entire search space was explored.
	SearchComplete bool
}