Function buildTemporalDepGraph

analysis/temporal.go:166–205

buildTemporalDepGraph builds a dependency graph for the program using the existing depGraph type.

(programInfo *ProgramInfo)

// buildTemporalDepGraph builds a dependency graph for the program using the existing depGraph type.
func buildTemporalDepGraph(programInfo *ProgramInfo) depGraph {
	dep := make(depGraph)

	// Initialize nodes for all IDB predicates
	for pred := range programInfo.IdbPredicates {
		dep.initNode(pred)
	}

	// Build edges from rule dependencies
	for _, rule := range programInfo.Rules {
		headPred := rule.Head.Predicate
		dep.initNode(headPred)

		for _, premise := range rule.Premises {
			var bodyPred ast.PredicateSym
			switch p := premise.(type) {
			case ast.Atom:
				bodyPred = p.Predicate
			case ast.NegAtom:
				bodyPred = p.Atom.Predicate
			case ast.TemporalLiteral:
				switch lit := p.Literal.(type) {
				case ast.Atom:
					bodyPred = lit.Predicate
				case ast.NegAtom:
					bodyPred = lit.Atom.Predicate
				}
			default:
				continue
			}

			// Only track dependencies to IDB predicates
			if _, isIDB := programInfo.IdbPredicates[bodyPred]; isIDB {
				dep.addEdge(headPred, bodyPred, false)
			}
		}
	}

	return dep
}

// isInSameSCC checks if two predicates are in the same strongly connected component.
func isInSameSCC(pred1, pred2 ast.PredicateSym, sccs []Nodeset) bool {