Client Delivery
Review declared project critical paths and slack
Review the dependency path controlling a scoped automation implementation, and see which supplied tasks have slack.
Experimental native example · local preview · revision 1
WORKFLOW PREVIEW
See how it works
Use + and − to zoom, F to fit. Press Enter on a node to inspect it.
Private preview. These tested drafts are available for inspection. Adding them to a Vora workspace is still being tested.
What you need
- Authorized supplied facts matching the closed contract.
- Declared completeness, identity and unit assumptions reviewed by an agency operator.
Follow the workflow step by step
Supplied agency data
Receive the explicitly supplied manual input packet.
Review declared project critical paths and slack
Review the dependency path controlling a scoped automation implementation, and see which supplied tasks have slack.
Setup and review
- Download the workflow JSON from this page and inspect its inputs schema and Code node.
- Prepare a synthetic packet matching the input schema. Keep unknown values explicit and report completeness honestly.
- Review the on-page literal example before running your own supplied-data case.
- Inspect every unknown, tie, missing reference or bounded status before taking a downstream action.
Inspect every node
Expand a node to inspect its complete settings. Review the runtime and adoption evidence before installing it.
Supplied agency data · wfManualTrigger
{
"label": "Supplied agency data"
}Review declared project critical paths and slack · code
{
"code": "\nfunction fail(reason){throw new Error('input: '+reason);}\nfunction check(schema,value,where){\n if(value===null){if(schema.type==='null'||Array.isArray(schema.type)&&schema.type.includes('null'))return;fail(where+' wrong_type');}\n const type=Array.isArray(schema.type)?schema.type[0]:schema.type;\n if(type==='object'){\n if(!value||typeof value!=='object'||Array.isArray(value))fail(where+' wrong_type');\n for(const name of Object.keys(value))if(!Object.hasOwn(schema.properties,name))fail(where+' unknown_field');\n for(const name of schema.required)if(!Object.hasOwn(value,name))fail(where+' missing_field');\n for(const [name,shape]of Object.entries(schema.properties))check(shape,value[name],where+'.'+name);\n }else if(type==='array'){\n if(!Array.isArray(value)||value.length>schema.maxItems)fail(where+' array_bound');\n for(const item of value)check(schema.items,item,where+'[]');\n }else if(type==='string'){if(typeof value!=='string'||value.length>schema.maxLength)fail(where+' string_bound');}\n else if(type==='integer'){if(!Number.isSafeInteger(value)||value<schema.minimum||value>schema.maximum)fail(where+' integer_bound');}\n else if(type==='boolean'){if(typeof value!=='boolean')fail(where+' wrong_type');}\n else fail(where+' unsupported_type');\n}\nfunction id(value){if(typeof value!=='string'||!value||value.trim()!==value)fail('noncanonical_identity');return value;}\nfunction unique(values,reason){if(new Set(values).size!==values.length)fail(reason);}\nfunction safeAdd(a,b){if(a>Number.MAX_SAFE_INTEGER-b)fail('unsafe_sum');return a+b;}\nfunction day(value){if(!/^\\d{4}-\\d{2}-\\d{2}$/.test(value))fail('invalid_calendar_day');const ms=Date.parse(value+'T00:00:00Z');if(!Number.isFinite(ms)||new Date(ms).toISOString().slice(0,10)!==value)fail('invalid_calendar_day');return ms;}\nfunction refKey(ref){id(ref.assetId);if(ref.version<1)fail('positive_version_required');return JSON.stringify([ref.assetId,ref.version]);}\nfunction refValue(key){const pair=JSON.parse(key);return {assetId:pair[0],version:pair[1]};}\nfunction sortedRefs(keys){return [...keys].sort().map(refValue);}\n\nfunction lexIds(a,b){for(let i=0;i<Math.min(a.length,b.length);i++){if(a[i]<b[i])return -1;if(a[i]>b[i])return 1;}return a.length-b.length;}\nfunction maxSubset(rows,idField,feasible){let best=-1,ids=[],ties=0;for(let mask=0;mask<2**rows.length;mask++){const chosen=rows.filter((_,i)=>mask&(1<<i));if(!feasible(chosen))continue;const value=chosen.reduce((n,r)=>n+r.valuePoints,0),current=chosen.map(r=>r[idField]).sort();if(value>best){best=value;ids=current;ties=1;}else if(value===best){ties++;if(lexIds(current,ids)<0)ids=current;}}return {ids,value:best,ties};}\nfunction rat(n,d){if(d===0n)fail('zero_denominator');if(d<0n){n=-n;d=-d;}let a=n<0n?-n:n,b=d;while(b){const next=a%b;a=b;b=next;}return [n/a,d/a];}\nfunction ratAdd(a,b){return rat(a[0]*b[1]+b[0]*a[1],a[1]*b[1]);}\nfunction ratSub(a,b){return rat(a[0]*b[1]-b[0]*a[1],a[1]*b[1]);}\nfunction ratMul(a,b){return rat(a[0]*b[0],a[1]*b[1]);}\nfunction ratText(a){return a[0].toString()+'/'+a[1].toString();}\n\n\ncheck({\"type\":\"object\",\"properties\":{\"scopeId\":{\"type\":\"string\",\"maxLength\":128},\"selectionComplete\":{\"type\":[\"boolean\",\"null\"]},\"tasks\":{\"type\":\"array\",\"items\":{\"type\":\"object\",\"properties\":{\"taskId\":{\"type\":\"string\",\"maxLength\":128},\"durationUnits\":{\"type\":[\"integer\",\"null\"],\"minimum\":1,\"maximum\":100000},\"dependsOn\":{\"type\":\"array\",\"items\":{\"type\":\"string\",\"maxLength\":128},\"maxItems\":10}},\"required\":[\"taskId\",\"durationUnits\",\"dependsOn\"],\"additionalProperties\":false},\"maxItems\":30}},\"required\":[\"scopeId\",\"selectionComplete\",\"tasks\"],\"additionalProperties\":false},context.input,\"input\");\nconst result=(function criticalPath(x){\n id(x.scopeId);unique(x.tasks.map(t=>id(t.taskId)),'duplicate_task_id');const tasks=new Map(x.tasks.map(t=>[t.taskId,t])),degree=new Map(),children=new Map(x.tasks.map(t=>[t.taskId,[]])),missing=new Set(),unknown=x.tasks.filter(t=>t.durationUnits===null).map(t=>t.taskId).sort();\n for(const t of x.tasks){unique(t.dependsOn.map(id),'duplicate_dependency');degree.set(t.taskId,t.dependsOn.length);for(const d of t.dependsOn){if(!tasks.has(d))missing.add(d);else children.get(d).push(t.taskId);}}\n const queue=x.tasks.filter(t=>degree.get(t.taskId)===0).map(t=>t.taskId).sort(),order=[];\n while(queue.length){const next=queue.shift();order.push(next);for(const child of children.get(next)){degree.set(child,degree.get(child)-1);if(degree.get(child)===0){queue.push(child);queue.sort();}}}\n const unresolved=x.tasks.filter(t=>!order.includes(t.taskId)).map(t=>t.taskId).sort(),base={projectDurationUnits:null,rows:[],criticalTaskIds:[],missingDependencyIds:[...missing].sort(),unresolvedTaskIds:unresolved,unknownDurationTaskIds:unknown};\n if(missing.size)return {status:'incomplete_dependencies',...base};if(unresolved.length)return {status:'cyclic_or_blocked_dependencies',...base};if(x.selectionComplete!==true||unknown.length)return {status:'unknown',...base};\n const earliest=new Map(),finish=new Map(),latest=new Map();let total=0;\n for(const name of order){const t=tasks.get(name),start=t.dependsOn.length?Math.max(...t.dependsOn.map(d=>finish.get(d))):0;earliest.set(name,start);finish.set(name,start+t.durationUnits);total=Math.max(total,finish.get(name));}\n for(const name of [...order].reverse()){const t=tasks.get(name),cs=children.get(name),end=cs.length?Math.min(...cs.map(c=>latest.get(c))):total;latest.set(name,end-t.durationUnits);}\n const rows=[...tasks.keys()].sort().map(taskId=>({taskId,earliestStartUnits:earliest.get(taskId),latestStartUnits:latest.get(taskId),slackUnits:latest.get(taskId)-earliest.get(taskId)}));\n return {status:'schedule_within_supplied_tasks',...base,projectDurationUnits:total,rows,criticalTaskIds:rows.filter(r=>r.slackUnits===0).map(r=>r.taskId)};\n})(context.input);\ncheck({\"type\":\"object\",\"properties\":{\"status\":{\"type\":\"string\",\"maxLength\":128},\"projectDurationUnits\":{\"type\":[\"integer\",\"null\"],\"minimum\":0,\"maximum\":3000000},\"rows\":{\"type\":\"array\",\"items\":{\"type\":\"object\",\"properties\":{\"taskId\":{\"type\":\"string\",\"maxLength\":128},\"earliestStartUnits\":{\"type\":\"integer\",\"minimum\":0,\"maximum\":3000000},\"latestStartUnits\":{\"type\":\"integer\",\"minimum\":0,\"maximum\":3000000},\"slackUnits\":{\"type\":\"integer\",\"minimum\":0,\"maximum\":3000000}},\"required\":[\"taskId\",\"earliestStartUnits\",\"latestStartUnits\",\"slackUnits\"],\"additionalProperties\":false},\"maxItems\":30},\"criticalTaskIds\":{\"type\":\"array\",\"items\":{\"type\":\"string\",\"maxLength\":128},\"maxItems\":100},\"missingDependencyIds\":{\"type\":\"array\",\"items\":{\"type\":\"string\",\"maxLength\":128},\"maxItems\":100},\"unresolvedTaskIds\":{\"type\":\"array\",\"items\":{\"type\":\"string\",\"maxLength\":128},\"maxItems\":100},\"unknownDurationTaskIds\":{\"type\":\"array\",\"items\":{\"type\":\"string\",\"maxLength\":128},\"maxItems\":100}},\"required\":[\"status\",\"projectDurationUnits\",\"rows\",\"criticalTaskIds\",\"missingDependencyIds\",\"unresolvedTaskIds\",\"unknownDurationTaskIds\"],\"additionalProperties\":false},result,\"output\");\nreturn result;",
"label": "Review declared project critical paths and slack",
"memoryLimit": 16,
"outputVar": "result",
"timeout": 1000
}Input and output contracts
Input
{
"type": "object",
"properties": {
"scopeId": {
"type": "string",
"maxLength": 128
},
"selectionComplete": {
"type": [
"boolean",
"null"
]
},
"tasks": {
"type": "array",
"items": {
"type": "object",
"properties": {
"taskId": {
"type": "string",
"maxLength": 128
},
"durationUnits": {
"type": [
"integer",
"null"
],
"minimum": 1,
"maximum": 100000
},
"dependsOn": {
"type": "array",
"items": {
"type": "string",
"maxLength": 128
},
"maxItems": 10
}
},
"required": [
"taskId",
"durationUnits",
"dependsOn"
],
"additionalProperties": false
},
"maxItems": 30
}
},
"required": [
"scopeId",
"selectionComplete",
"tasks"
],
"additionalProperties": false
}Output
{
"type": "object",
"properties": {
"status": {
"type": "string",
"maxLength": 128
},
"projectDurationUnits": {
"type": [
"integer",
"null"
],
"minimum": 0,
"maximum": 3000000
},
"rows": {
"type": "array",
"items": {
"type": "object",
"properties": {
"taskId": {
"type": "string",
"maxLength": 128
},
"earliestStartUnits": {
"type": "integer",
"minimum": 0,
"maximum": 3000000
},
"latestStartUnits": {
"type": "integer",
"minimum": 0,
"maximum": 3000000
},
"slackUnits": {
"type": "integer",
"minimum": 0,
"maximum": 3000000
}
},
"required": [
"taskId",
"earliestStartUnits",
"latestStartUnits",
"slackUnits"
],
"additionalProperties": false
},
"maxItems": 30
},
"criticalTaskIds": {
"type": "array",
"items": {
"type": "string",
"maxLength": 128
},
"maxItems": 100
},
"missingDependencyIds": {
"type": "array",
"items": {
"type": "string",
"maxLength": 128
},
"maxItems": 100
},
"unresolvedTaskIds": {
"type": "array",
"items": {
"type": "string",
"maxLength": 128
},
"maxItems": 100
},
"unknownDurationTaskIds": {
"type": "array",
"items": {
"type": "string",
"maxLength": 128
},
"maxItems": 100
}
},
"required": [
"status",
"projectDurationUnits",
"rows",
"criticalTaskIds",
"missingDependencyIds",
"unresolvedTaskIds",
"unknownDurationTaskIds"
],
"additionalProperties": false
}Choose an output for this job
This business workflow also has 15 delivery formats. Compare their inputs, output examples and limits.
Example input and result
These examples use synthetic data.
Input
{
"scopeId": "client-A",
"selectionComplete": true,
"tasks": [
{
"taskId": "a",
"durationUnits": 2,
"dependsOn": []
},
{
"taskId": "b",
"durationUnits": 3,
"dependsOn": [
"a"
]
},
{
"taskId": "c",
"durationUnits": 4,
"dependsOn": [
"a"
]
},
{
"taskId": "d",
"durationUnits": 1,
"dependsOn": [
"b",
"c"
]
}
]
}Expected result
{
"status": "schedule_within_supplied_tasks",
"projectDurationUnits": 7,
"rows": [
{
"taskId": "a",
"earliestStartUnits": 0,
"latestStartUnits": 0,
"slackUnits": 0
},
{
"taskId": "b",
"earliestStartUnits": 2,
"latestStartUnits": 3,
"slackUnits": 1
},
{
"taskId": "c",
"earliestStartUnits": 2,
"latestStartUnits": 2,
"slackUnits": 0
},
{
"taskId": "d",
"earliestStartUnits": 6,
"latestStartUnits": 6,
"slackUnits": 0
}
],
"criticalTaskIds": [
"a",
"c",
"d"
],
"missingDependencyIds": [],
"unresolvedTaskIds": [],
"unknownDurationTaskIds": []
}Success means: Review the dependency path controlling a scoped automation implementation, and see which supplied tasks have slack.
When something goes wrong
- Correct malformed facts and rerun. Incomplete or unknown facts remain uncertain; do not fabricate a resolution.
Limits and costs
- Elapsed work-unit offsets only, no business calendar. All declared dependencies must resolve, graph must be acyclic, durations known and selection complete before schedule/slack. Unresolved Kahn nodes may include downstream blockage, not only exact cycle members. A ready task and a task controlling completion are different planning decisions. With a complete, acyclic dependency graph and known positive durations, forward and backward passes produce earliest start, latest start and slack in elapsed work units. Missing dependencies, blocked cycles and unknown durations prevent a schedule claim. Kahn-unresolved IDs can include tasks downstream of a cycle.
- No paid model calls or metered third-party operations are declared in this pure graph. Vora plan availability, compute and quotas still apply; pricing has not been verified by this batch.