> ## Documentation Index > Fetch the complete documentation index at: https://docs.gorules.io/llms.txt > Use this file to discover all available pages before exploring further. # Eligibility and approval workflows > Build rules that determine qualification for loans, services, benefits, or access. export const DecisionGraphViz = ({nodes = [], edges = [], highlighted = null, title = null}) => { const nodeColors = { input: { bg: '#f8fafc', border: '#94a3b8', text: '#475569', icon: '→' }, output: { bg: '#f8fafc', border: '#94a3b8', text: '#475569', icon: '←' }, table: { bg: '#fefce8', border: '#d9c860', text: '#7c6f2a', icon: '▤' }, expression: { bg: '#f5f3ff', border: '#a78bda', text: '#5b4a8c', icon: 'ƒ' }, function: { bg: '#fdf2f8', border: '#e293b7', text: '#8c4a6d', icon: '{ }' }, switch: { bg: '#f0fdfa', border: '#6bc4b8', text: '#3d7a72', icon: '◇' } }; const nodeWidth = 140; const nodeHeight = 64; const horizontalGap = 80; const verticalGap = 24; const inDegree = {}; const outEdges = {}; nodes.forEach(n => { inDegree[n.id] = 0; outEdges[n.id] = []; }); edges.forEach(e => { inDegree[e.to] = (inDegree[e.to] || 0) + 1; outEdges[e.from] = outEdges[e.from] || []; outEdges[e.from].push(e.to); }); const queue = nodes.filter(n => inDegree[n.id] === 0).map(n => n.id); const nodeLevel = {}; queue.forEach(id => nodeLevel[id] = 0); const tempInDegree = { ...inDegree }; while (queue.length > 0) { const current = queue.shift(); const currentLevel = nodeLevel[current]; (outEdges[current] || []).forEach(next => { nodeLevel[next] = Math.max(nodeLevel[next] || 0, currentLevel + 1); tempInDegree[next]--; if (tempInDegree[next] === 0) queue.push(next); }); } const levels = {}; nodes.forEach(n => { const level = nodeLevel[n.id] || 0; levels[level] = levels[level] || []; levels[level].push(n); }); const nodePositions = {}; const numLevels = Object.keys(levels).length; const maxNodesInLevel = Math.max(...Object.values(levels).map(l => l.length), 1); const canvasHeight = Math.max(maxNodesInLevel * (nodeHeight + verticalGap) + 60, 180); const canvasWidth = numLevels * (nodeWidth + horizontalGap) + 80; Object.entries(levels).forEach(([level, levelNodes]) => { const levelNum = parseInt(level); const x = 40 + levelNum * (nodeWidth + horizontalGap); const totalHeight = levelNodes.length * nodeHeight + (levelNodes.length - 1) * verticalGap; const startY = (canvasHeight - totalHeight) / 2; levelNodes.forEach((node, index) => { nodePositions[node.id] = { x, y: startY + index * (nodeHeight + verticalGap) }; }); }); const edgePaths = edges.map((edge, i) => { const from = nodePositions[edge.from]; const to = nodePositions[edge.to]; if (!from || !to) return null; const startX = from.x + nodeWidth; const startY = from.y + nodeHeight / 2; const endX = to.x - 6; const endY = to.y + nodeHeight / 2; const dx = endX - startX; const controlOffset = Math.min(dx * 0.4, 40); return { key: `edge-${i}`, path: `M ${startX} ${startY} C ${startX + controlOffset} ${startY}, ${endX - controlOffset} ${endY}, ${endX} ${endY}` }; }).filter(Boolean); const uniqueId = `graph-${Math.random().toString(36).substring(2, 11)}`; const containerRef = useRef(null); const [scale, setScale] = useState(1); const [position, setPosition] = useState({ x: 0, y: 0 }); const [isDragging, setIsDragging] = useState(false); const [dragStart, setDragStart] = useState({ x: 0, y: 0 }); const handleWheel = e => { e.preventDefault(); const delta = e.deltaY > 0 ? -0.1 : 0.1; setScale(s => Math.max(0.4, Math.min(2, s + delta))); }; const handleMouseDown = e => { if (e.target.closest('button')) return; setIsDragging(true); setDragStart({ x: e.clientX - position.x, y: e.clientY - position.y }); }; const handleMouseMove = e => { if (!isDragging) return; setPosition({ x: e.clientX - dragStart.x, y: e.clientY - dragStart.y }); }; const handleMouseUp = () => setIsDragging(false); const handleFit = () => { const container = containerRef.current; if (container) { const containerWidth = container.clientWidth - 40; const containerHeight = container.clientHeight - 80; const scaleX = containerWidth / canvasWidth; const scaleY = containerHeight / canvasHeight; const fitScale = Math.min(scaleX, scaleY, 1); setScale(Math.max(0.4, fitScale)); } else { setScale(1); } setPosition({ x: 0, y: 0 }); }; const handleZoomIn = () => setScale(s => Math.min(s + 0.15, 2)); const handleZoomOut = () => setScale(s => Math.max(s - 0.15, 0.4)); useEffect(() => { const container = containerRef.current; if (container) { container.addEventListener('wheel', handleWheel, { passive: false }); return () => container.removeEventListener('wheel', handleWheel); } }, []); useEffect(() => { const timer = setTimeout(() => { const container = containerRef.current; if (container) { const containerWidth = container.clientWidth - 40; const containerHeight = container.clientHeight - 80; const scaleX = containerWidth / canvasWidth; const scaleY = containerHeight / canvasHeight; const fitScale = Math.min(scaleX, scaleY, 1); setScale(Math.max(0.4, fitScale)); } }, 0); return () => clearTimeout(timer); }, [canvasWidth, canvasHeight]); const containerHeight = Math.max(300, Math.min(canvasHeight + 80, 420)); return
{title &&
{title}
}
{}
{}
{} {edgePaths.map(edge => )} {} {nodes.map(node => { const pos = nodePositions[node.id]; if (!pos) return null; const colors = nodeColors[node.type] || nodeColors.expression; const isHighlighted = highlighted === node.id; return
{colors.icon}
{node.label}
; })}
{}
{Object.entries(nodeColors).map(([type, colors]) =>
{colors.icon}
{type}
)}
; }; export const ExpressionViz = ({entries = []}) => { const allCells = entries.flatMap((entry, i) => [
{entry.key}
,
{entry.value}
]); return
{allCells}
; }; export const DecisionTableViz = ({inputs = [], outputs = [], rows = []}) => { const colCount = inputs.length + outputs.length; const getFieldDisplay = field => !field || field === '-' ? '-' : field; const allCells = rows.flatMap((row, ri) => [...inputs.map((input, i) =>
{row[input.field] ?? ''}
), ...outputs.map((output, i) =>
{row[output.field] ?? ''}
)]); return
{}
Inputs
Outputs
{} {inputs.map((input, i) =>
{input.name}
{getFieldDisplay(input.field)}
)} {outputs.map((output, i) =>
{output.name}
{getFieldDisplay(output.field)}
)} {} {allCells}
; }; This guide shows how to build eligibility rules that evaluate applicants against multiple criteria and route them through approval workflows. ## What you'll build An eligibility decision that: * Evaluates applicants against qualification criteria * Handles multiple approval paths (auto-approve, manual review, deny) * Provides clear reasons for decisions * Supports tiered approval thresholds Want to skip ahead? Download the completed decision and import it directly. ### Decision flow ## Example: Loan pre-qualification ### Input data ```json theme={null} { "applicant": { "age": 32, "income": 75000, "employmentYears": 4, "creditScore": 720 }, "loan": { "amount": 25000, "purpose": "home_improvement" } } ``` ## Step 1: Basic eligibility checks First, check hard requirements that must be met: = 65", "applicant.income": "", "applicant.employmentYears": "", eligible: "false", reason: '"Age exceeds limit"' }, { "applicant.age": "", "applicant.income": "< 25000", "applicant.employmentYears": "", eligible: "false", reason: '"Income below minimum"' }, { "applicant.age": "", "applicant.income": "", "applicant.employmentYears": "< 1", eligible: "false", reason: '"Insufficient employment history"' }, { "applicant.age": "", "applicant.income": "", "applicant.employmentYears": "", eligible: "true", reason: '"Meets basic requirements"' } ]} /> ## Step 2: Credit assessment Evaluate credit score bands: = 750", tier: '"excellent"', multiple: "5" }, { "applicant.creditScore": "[700..749]", tier: '"good"', multiple: "4" }, { "applicant.creditScore": "[650..699]", tier: '"fair"', multiple: "3" }, { "applicant.creditScore": "[600..649]", tier: '"poor"', multiple: "2" }, { "applicant.creditScore": "< 600", tier: '"denied"', multiple: "0" } ]} /> ## Step 3: Calculate loan capacity Use an expression to determine maximum loan amount: ## Step 4: Determine approval path Route to different outcomes based on risk: 1", decision: '"partial"', nextStep: '"counter_offer"' } ]} /> ## Output structure ```json theme={null} { "decision": "approved", "nextStep": "verification", "approvedAmount": 25000, "creditTier": "good", "reasons": ["Meets basic requirements", "Good credit standing"] } ``` ## Example: Benefits eligibility ### Household income check = 3", income: "< 25000", eligible: "true", level: '"full"' }, { size: ">= 3", income: "[25000..45000]", eligible: "true", level: '"partial"' }, { size: "", income: "", eligible: "false", level: '"none"' } ]} /> ## Example: Access control ### Feature access by subscription ## Best practices **Fail fast** — Put disqualifying checks first to exit early. **Provide reasons** — Always output why a decision was made. **Handle edge cases** — Include catch-all rows for unexpected inputs. **Version your rules** — Track changes when eligibility criteria update.