mermaid (#3)
Browse files- clau (29b68a9a286e8b56c7dbbb357b718753e5a47f51)
- mermaid (a9eb975d4673cabf23938b05bc50adc89bab502d)
app.py
CHANGED
|
@@ -3,25 +3,41 @@ import json
|
|
| 3 |
import re
|
| 4 |
from collections import defaultdict
|
| 5 |
from ortools.sat.python import cp_model
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 6 |
|
| 7 |
def parse_requirements(requirements):
|
| 8 |
"""Parse requirements list into dependency graph."""
|
| 9 |
dependencies = defaultdict(list)
|
| 10 |
all_tasks = set()
|
|
|
|
| 11 |
|
| 12 |
for req in requirements:
|
| 13 |
if not req.strip():
|
| 14 |
continue
|
| 15 |
# Match pattern like "TaskA requires TaskB"
|
| 16 |
-
|
| 17 |
-
match = re.match(r'(\w+)\s+requires\s+(\w+)', req.strip())
|
| 18 |
if match:
|
| 19 |
-
|
|
|
|
|
|
|
|
|
|
| 20 |
all_tasks.add(task)
|
| 21 |
all_tasks.add(required)
|
| 22 |
dependencies[task].append(required)
|
|
|
|
|
|
|
|
|
|
|
|
|
| 23 |
|
| 24 |
-
return dependencies, list(all_tasks)
|
| 25 |
|
| 26 |
def solve_all_tasks(dependencies, all_tasks):
|
| 27 |
"""Try to schedule all tasks (works if DAG)."""
|
|
@@ -96,33 +112,218 @@ def solve_maximum_subset(dependencies, all_tasks):
|
|
| 96 |
|
| 97 |
return []
|
| 98 |
|
| 99 |
-
def
|
| 100 |
-
"""
|
| 101 |
-
if not
|
| 102 |
-
return
|
| 103 |
|
| 104 |
-
|
| 105 |
-
|
| 106 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 107 |
|
| 108 |
-
|
| 109 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 110 |
|
| 111 |
-
|
|
|
|
| 112 |
|
| 113 |
-
|
| 114 |
-
|
|
|
|
|
|
|
| 115 |
|
| 116 |
# Create dependency summary
|
| 117 |
dep_summary = "**Parsed Dependencies:**\n"
|
| 118 |
if dependencies:
|
| 119 |
for task, deps in dependencies.items():
|
| 120 |
-
|
| 121 |
-
|
| 122 |
-
|
| 123 |
|
| 124 |
-
dep_summary += f"\n**Total tasks
|
| 125 |
-
|
|
|
|
| 126 |
|
| 127 |
# Try to solve
|
| 128 |
result = solve_all_tasks(dependencies, all_tasks)
|
|
@@ -131,11 +332,16 @@ def solve_task_ordering_ui(requirements_text):
|
|
| 131 |
# All tasks can be executed
|
| 132 |
output = "β
**All tasks can be executed!**\n\n"
|
| 133 |
output += "**Optimal execution order:**\n"
|
|
|
|
|
|
|
| 134 |
for i, task in enumerate(result, 1):
|
| 135 |
-
|
|
|
|
|
|
|
| 136 |
|
| 137 |
-
|
| 138 |
-
|
|
|
|
| 139 |
|
| 140 |
else:
|
| 141 |
# Try maximum subset
|
|
@@ -145,122 +351,269 @@ def solve_task_ordering_ui(requirements_text):
|
|
| 145 |
excluded_tasks = set(all_tasks) - set(result)
|
| 146 |
output = f"β οΈ **Circular dependencies detected!**\n\n"
|
| 147 |
output += f"**Maximum executable tasks ({len(result)}/{len(all_tasks)}):**\n"
|
|
|
|
|
|
|
| 148 |
for i, task in enumerate(result, 1):
|
| 149 |
-
|
|
|
|
|
|
|
| 150 |
|
| 151 |
if excluded_tasks:
|
| 152 |
output += f"\n**β Excluded tasks (due to circular dependencies):**\n"
|
| 153 |
for task in sorted(excluded_tasks):
|
| 154 |
-
|
|
|
|
| 155 |
|
| 156 |
-
json_output = json.dumps(
|
|
|
|
|
|
|
| 157 |
else:
|
| 158 |
output = "β **No solution found!** There might be complex circular dependencies."
|
| 159 |
json_output = "[]"
|
|
|
|
|
|
|
| 160 |
|
| 161 |
-
return output, dep_summary, json_output
|
| 162 |
|
| 163 |
except Exception as e:
|
| 164 |
-
return f"β **Error:** {str(e)}", "", ""
|
| 165 |
|
| 166 |
-
# Example
|
| 167 |
-
|
| 168 |
-
|
| 169 |
-
|
| 170 |
-
|
| 171 |
-
|
| 172 |
-
|
| 173 |
-
Clean_dining_room
|
|
|
|
| 174 |
|
| 175 |
# Create Gradio interface
|
| 176 |
with gr.Blocks(title="Task Dependency Solver", theme=gr.themes.Soft()) as demo:
|
| 177 |
gr.Markdown("""
|
| 178 |
# π Task Dependency Solver
|
| 179 |
|
| 180 |
-
|
| 181 |
|
| 182 |
**How to use:**
|
| 183 |
-
1. Enter your
|
| 184 |
-
2.
|
| 185 |
-
3. Click "
|
| 186 |
-
|
| 187 |
-
**Features:**
|
| 188 |
-
- β
Finds optimal task ordering
|
| 189 |
-
- π Handles circular dependencies
|
| 190 |
-
- π Maximizes the number of executable tasks
|
| 191 |
-
- π― Uses Google OR-Tools constraint solver
|
| 192 |
""")
|
| 193 |
|
|
|
|
|
|
|
|
|
|
| 194 |
with gr.Row():
|
| 195 |
with gr.Column(scale=1):
|
| 196 |
-
|
| 197 |
-
|
| 198 |
-
|
| 199 |
-
|
| 200 |
-
|
|
|
|
|
|
|
| 201 |
)
|
| 202 |
|
| 203 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 204 |
|
| 205 |
-
gr.Markdown("""
|
| 206 |
-
**Example formats:**
|
| 207 |
-
- `Sleep requires dinner`
|
| 208 |
-
- `Dinner requires prep`
|
| 209 |
-
- `Prep requires shopping`
|
| 210 |
-
""")
|
| 211 |
-
|
| 212 |
with gr.Column(scale=1):
|
| 213 |
-
|
|
|
|
| 214 |
|
| 215 |
-
with gr.Accordion("
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 216 |
dep_analysis = gr.Markdown()
|
| 217 |
|
| 218 |
with gr.Accordion("πΎ JSON Output", open=False):
|
| 219 |
-
json_output = gr.Code(language="json"
|
| 220 |
|
| 221 |
-
#
|
| 222 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 223 |
gr.Markdown("""
|
| 224 |
-
**
|
| 225 |
-
```
|
| 226 |
-
Leave_house requires breakfast
|
| 227 |
-
Leave_house requires dressed
|
| 228 |
-
Breakfast requires coffee
|
| 229 |
-
Coffee requires water
|
| 230 |
-
Dressed requires shower
|
| 231 |
-
Shower requires wake_up
|
| 232 |
-
```
|
| 233 |
|
| 234 |
-
|
| 235 |
-
```
|
| 236 |
-
Deploy requires tests_pass
|
| 237 |
-
Deploy requires build_complete
|
| 238 |
-
Tests_pass requires code_review
|
| 239 |
-
Build_complete requires dependencies_installed
|
| 240 |
-
Code_review requires code_written
|
| 241 |
-
Dependencies_installed requires environment_setup
|
| 242 |
-
```
|
| 243 |
|
| 244 |
-
**
|
| 245 |
-
```
|
| 246 |
-
A requires B
|
| 247 |
-
B requires C
|
| 248 |
-
C requires A
|
| 249 |
-
D requires E
|
| 250 |
-
```
|
| 251 |
""")
|
| 252 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 253 |
solve_btn.click(
|
| 254 |
-
fn=
|
| 255 |
-
inputs=[
|
| 256 |
-
outputs=[result_output, dep_analysis, json_output]
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 257 |
)
|
| 258 |
|
| 259 |
-
#
|
| 260 |
demo.load(
|
| 261 |
-
fn=
|
| 262 |
-
inputs=[
|
| 263 |
-
outputs=[
|
| 264 |
)
|
| 265 |
|
| 266 |
if __name__ == "__main__":
|
|
|
|
| 3 |
import re
|
| 4 |
from collections import defaultdict
|
| 5 |
from ortools.sat.python import cp_model
|
| 6 |
+
from datetime import datetime, timedelta
|
| 7 |
+
|
| 8 |
+
def normalize_task_name(task):
|
| 9 |
+
"""Normalize task name to lowercase for consistent comparison."""
|
| 10 |
+
return task.strip().lower()
|
| 11 |
+
|
| 12 |
+
def display_task_name(task):
|
| 13 |
+
"""Format task name for display (title case)."""
|
| 14 |
+
return task.replace('_', ' ').title()
|
| 15 |
|
| 16 |
def parse_requirements(requirements):
|
| 17 |
"""Parse requirements list into dependency graph."""
|
| 18 |
dependencies = defaultdict(list)
|
| 19 |
all_tasks = set()
|
| 20 |
+
original_names = {} # Store original casing
|
| 21 |
|
| 22 |
for req in requirements:
|
| 23 |
if not req.strip():
|
| 24 |
continue
|
| 25 |
# Match pattern like "TaskA requires TaskB"
|
| 26 |
+
match = re.match(r'(\w+)\s+requires\s+(\w+)', req.strip(), re.IGNORECASE)
|
|
|
|
| 27 |
if match:
|
| 28 |
+
task_orig, required_orig = match.groups()
|
| 29 |
+
task = normalize_task_name(task_orig)
|
| 30 |
+
required = normalize_task_name(required_orig)
|
| 31 |
+
|
| 32 |
all_tasks.add(task)
|
| 33 |
all_tasks.add(required)
|
| 34 |
dependencies[task].append(required)
|
| 35 |
+
|
| 36 |
+
# Store original names for display
|
| 37 |
+
original_names[task] = task_orig
|
| 38 |
+
original_names[required] = required_orig
|
| 39 |
|
| 40 |
+
return dependencies, list(all_tasks), original_names
|
| 41 |
|
| 42 |
def solve_all_tasks(dependencies, all_tasks):
|
| 43 |
"""Try to schedule all tasks (works if DAG)."""
|
|
|
|
| 112 |
|
| 113 |
return []
|
| 114 |
|
| 115 |
+
def parse_tasks(tasks_text):
|
| 116 |
+
"""Parse tasks from text input."""
|
| 117 |
+
if not tasks_text.strip():
|
| 118 |
+
return [], {}
|
| 119 |
|
| 120 |
+
# Split by lines or commas and clean up
|
| 121 |
+
tasks = []
|
| 122 |
+
original_names = {}
|
| 123 |
+
|
| 124 |
+
for line in tasks_text.strip().split('\n'):
|
| 125 |
+
for task_orig in line.split(','):
|
| 126 |
+
task_orig = task_orig.strip()
|
| 127 |
+
if task_orig:
|
| 128 |
+
task = normalize_task_name(task_orig)
|
| 129 |
+
if task not in [normalize_task_name(t) for t in tasks]:
|
| 130 |
+
tasks.append(task)
|
| 131 |
+
original_names[task] = task_orig
|
| 132 |
+
|
| 133 |
+
return sorted(tasks), original_names
|
| 134 |
+
|
| 135 |
+
def generate_mermaid_gantt(task_order, original_names):
|
| 136 |
+
"""Generate Mermaid Gantt chart syntax."""
|
| 137 |
+
if not task_order:
|
| 138 |
+
return "gantt\n title Task Execution Timeline\n dateFormat YYYY-MM-DD\n section No Tasks\n No tasks to display : 2024-01-01, 1d"
|
| 139 |
+
|
| 140 |
+
# Start from today
|
| 141 |
+
start_date = datetime.now()
|
| 142 |
+
|
| 143 |
+
gantt = "```mermaid\ngantt\n"
|
| 144 |
+
gantt += " title Task Execution Timeline\n"
|
| 145 |
+
gantt += " dateFormat YYYY-MM-DD\n"
|
| 146 |
+
gantt += " section Tasks\n"
|
| 147 |
+
|
| 148 |
+
current_date = start_date
|
| 149 |
+
for i, task in enumerate(task_order):
|
| 150 |
+
display_name = original_names.get(task, display_task_name(task))
|
| 151 |
+
# Clean task name for Mermaid (remove special chars)
|
| 152 |
+
clean_name = re.sub(r'[^a-zA-Z0-9\s]', '', display_name)
|
| 153 |
+
|
| 154 |
+
task_start = current_date.strftime("%Y-%m-%d")
|
| 155 |
+
current_date += timedelta(days=1)
|
| 156 |
+
|
| 157 |
+
gantt += f" {clean_name} : {task_start}, 1d\n"
|
| 158 |
+
|
| 159 |
+
gantt += "```"
|
| 160 |
+
return gantt
|
| 161 |
+
|
| 162 |
+
def generate_mermaid_flowchart(dependencies, all_tasks, original_names):
|
| 163 |
+
"""Generate Mermaid flowchart syntax."""
|
| 164 |
+
if not all_tasks:
|
| 165 |
+
return "flowchart TD\n A[No tasks to display]"
|
| 166 |
+
|
| 167 |
+
flowchart = "```mermaid\nflowchart TD\n"
|
| 168 |
+
|
| 169 |
+
# Create nodes for all tasks
|
| 170 |
+
for task in all_tasks:
|
| 171 |
+
display_name = original_names.get(task, display_task_name(task))
|
| 172 |
+
# Create a clean ID for the node
|
| 173 |
+
node_id = task.replace(' ', '_').replace('-', '_')
|
| 174 |
+
flowchart += f" {node_id}[{display_name}]\n"
|
| 175 |
+
|
| 176 |
+
# Add dependencies as edges
|
| 177 |
+
if dependencies:
|
| 178 |
+
for task, required_list in dependencies.items():
|
| 179 |
+
task_id = task.replace(' ', '_').replace('-', '_')
|
| 180 |
+
for required_task in required_list:
|
| 181 |
+
req_id = required_task.replace(' ', '_').replace('-', '_')
|
| 182 |
+
flowchart += f" {req_id} --> {task_id}\n"
|
| 183 |
+
else:
|
| 184 |
+
# If no dependencies, just show all tasks
|
| 185 |
+
flowchart += " style A fill:#e1f5fe\n"
|
| 186 |
+
|
| 187 |
+
flowchart += "```"
|
| 188 |
+
return flowchart
|
| 189 |
+
|
| 190 |
+
def update_dropdowns(tasks_text):
|
| 191 |
+
"""Update dropdown choices when tasks change."""
|
| 192 |
+
tasks, original_names = parse_tasks(tasks_text)
|
| 193 |
+
|
| 194 |
+
# Create display choices (original casing)
|
| 195 |
+
task_display_choices = [""] + [original_names.get(task, display_task_name(task)) for task in tasks]
|
| 196 |
+
req_display_choices = [original_names.get(task, display_task_name(task)) for task in tasks]
|
| 197 |
+
|
| 198 |
+
return (
|
| 199 |
+
gr.Dropdown(choices=task_display_choices, value=""),
|
| 200 |
+
gr.CheckboxGroup(choices=req_display_choices, value=[])
|
| 201 |
+
)
|
| 202 |
+
|
| 203 |
+
def add_dependencies(task_display, required_display_list, current_deps):
|
| 204 |
+
"""Add multiple dependencies for a single task."""
|
| 205 |
+
if not task_display:
|
| 206 |
+
return current_deps, "β οΈ Please select a task"
|
| 207 |
+
|
| 208 |
+
if not required_display_list:
|
| 209 |
+
return current_deps, "β οΈ Please select at least one requirement"
|
| 210 |
+
|
| 211 |
+
# Normalize for comparison
|
| 212 |
+
task = normalize_task_name(task_display)
|
| 213 |
+
required_tasks = [normalize_task_name(req) for req in required_display_list]
|
| 214 |
+
|
| 215 |
+
# Remove the selected task from requirements if somehow selected
|
| 216 |
+
required_tasks = [req for req in required_tasks if req != task]
|
| 217 |
+
|
| 218 |
+
if not required_tasks:
|
| 219 |
+
return current_deps, "β οΈ A task cannot require itself"
|
| 220 |
+
|
| 221 |
+
# Create new dependencies (using original display names)
|
| 222 |
+
new_deps = []
|
| 223 |
+
existing_deps = []
|
| 224 |
+
|
| 225 |
+
for req_display in required_display_list:
|
| 226 |
+
if normalize_task_name(req_display) in required_tasks:
|
| 227 |
+
new_dep = f"{task_display} requires {req_display}"
|
| 228 |
+
|
| 229 |
+
# Check if this dependency already exists (case-insensitive)
|
| 230 |
+
exists = any(
|
| 231 |
+
normalize_task_name(dep.split(' requires ')[0]) == task and
|
| 232 |
+
normalize_task_name(dep.split(' requires ')[1]) == normalize_task_name(req_display)
|
| 233 |
+
for dep in current_deps if ' requires ' in dep
|
| 234 |
+
)
|
| 235 |
+
|
| 236 |
+
if exists:
|
| 237 |
+
existing_deps.append(req_display)
|
| 238 |
+
else:
|
| 239 |
+
new_deps.append(new_dep)
|
| 240 |
+
|
| 241 |
+
if not new_deps and existing_deps:
|
| 242 |
+
return current_deps, f"β οΈ All selected dependencies already exist"
|
| 243 |
+
|
| 244 |
+
updated_deps = current_deps + new_deps
|
| 245 |
+
|
| 246 |
+
# Create status message
|
| 247 |
+
status_parts = []
|
| 248 |
+
if new_deps:
|
| 249 |
+
status_parts.append(f"β
Added {len(new_deps)} dependencies")
|
| 250 |
+
if existing_deps:
|
| 251 |
+
status_parts.append(f"β οΈ {len(existing_deps)} already existed")
|
| 252 |
+
|
| 253 |
+
status = " | ".join(status_parts)
|
| 254 |
+
|
| 255 |
+
return updated_deps, status
|
| 256 |
+
|
| 257 |
+
def remove_dependency(deps_to_remove, current_deps):
|
| 258 |
+
"""Remove selected dependencies."""
|
| 259 |
+
if not deps_to_remove:
|
| 260 |
+
return current_deps, "β οΈ Please select dependencies to remove"
|
| 261 |
+
|
| 262 |
+
updated_deps = [dep for dep in current_deps if dep not in deps_to_remove]
|
| 263 |
+
removed_count = len(current_deps) - len(updated_deps)
|
| 264 |
+
return updated_deps, f"β
Removed {removed_count} dependencies"
|
| 265 |
+
|
| 266 |
+
def format_dependencies_display(dependencies_list):
|
| 267 |
+
"""Format dependencies for display."""
|
| 268 |
+
if not dependencies_list:
|
| 269 |
+
return "No dependencies added yet."
|
| 270 |
+
|
| 271 |
+
# Group by task for better readability
|
| 272 |
+
task_deps = defaultdict(list)
|
| 273 |
+
for dep in dependencies_list:
|
| 274 |
+
parts = dep.split(' requires ')
|
| 275 |
+
if len(parts) == 2:
|
| 276 |
+
task, required = parts
|
| 277 |
+
task_deps[task].append(required)
|
| 278 |
+
|
| 279 |
+
display = "**Current Dependencies:**\n"
|
| 280 |
+
for task in sorted(task_deps.keys(), key=str.lower):
|
| 281 |
+
requirements = ", ".join(sorted(task_deps[task], key=str.lower))
|
| 282 |
+
display += f"β’ **{task}** requires: {requirements}\n"
|
| 283 |
+
|
| 284 |
+
return display
|
| 285 |
+
|
| 286 |
+
def solve_dependencies(tasks_text, dependencies_list):
|
| 287 |
+
"""Solve the task ordering problem."""
|
| 288 |
+
tasks, task_original_names = parse_tasks(tasks_text)
|
| 289 |
+
|
| 290 |
+
if not tasks:
|
| 291 |
+
return "β Please enter some tasks!", "", "", "", ""
|
| 292 |
+
|
| 293 |
+
if not dependencies_list:
|
| 294 |
+
# No dependencies, just return tasks in alphabetical order
|
| 295 |
+
output = "β
**No dependencies - alphabetical order:**\n\n"
|
| 296 |
+
display_tasks = [task_original_names.get(task, display_task_name(task)) for task in tasks]
|
| 297 |
+
for i, task_display in enumerate(display_tasks, 1):
|
| 298 |
+
output += f"{i}. {task_display}\n"
|
| 299 |
|
| 300 |
+
json_output = json.dumps(display_tasks, indent=2)
|
| 301 |
+
gantt = generate_mermaid_gantt(tasks, task_original_names)
|
| 302 |
+
flowchart = generate_mermaid_flowchart({}, tasks, task_original_names)
|
| 303 |
+
return output, "", json_output, gantt, flowchart
|
| 304 |
+
|
| 305 |
+
try:
|
| 306 |
+
dependencies, all_tasks, dep_original_names = parse_requirements(dependencies_list)
|
| 307 |
|
| 308 |
+
# Merge original names
|
| 309 |
+
all_original_names = {**task_original_names, **dep_original_names}
|
| 310 |
|
| 311 |
+
# Add any tasks that aren't in dependencies
|
| 312 |
+
for task in tasks:
|
| 313 |
+
if task not in all_tasks:
|
| 314 |
+
all_tasks.append(task)
|
| 315 |
|
| 316 |
# Create dependency summary
|
| 317 |
dep_summary = "**Parsed Dependencies:**\n"
|
| 318 |
if dependencies:
|
| 319 |
for task, deps in dependencies.items():
|
| 320 |
+
task_display = all_original_names.get(task, display_task_name(task))
|
| 321 |
+
deps_display = [all_original_names.get(dep, display_task_name(dep)) for dep in deps]
|
| 322 |
+
dep_summary += f"β’ {task_display} requires: {', '.join(deps_display)}\n"
|
| 323 |
|
| 324 |
+
dep_summary += f"\n**Total tasks:** {len(all_tasks)}\n"
|
| 325 |
+
task_displays = [all_original_names.get(task, display_task_name(task)) for task in sorted(all_tasks)]
|
| 326 |
+
dep_summary += f"**Tasks:** {', '.join(task_displays)}"
|
| 327 |
|
| 328 |
# Try to solve
|
| 329 |
result = solve_all_tasks(dependencies, all_tasks)
|
|
|
|
| 332 |
# All tasks can be executed
|
| 333 |
output = "β
**All tasks can be executed!**\n\n"
|
| 334 |
output += "**Optimal execution order:**\n"
|
| 335 |
+
|
| 336 |
+
result_display = []
|
| 337 |
for i, task in enumerate(result, 1):
|
| 338 |
+
task_display = all_original_names.get(task, display_task_name(task))
|
| 339 |
+
output += f"{i}. {task_display}\n"
|
| 340 |
+
result_display.append(task_display)
|
| 341 |
|
| 342 |
+
json_output = json.dumps(result_display, indent=2)
|
| 343 |
+
gantt = generate_mermaid_gantt(result, all_original_names)
|
| 344 |
+
flowchart = generate_mermaid_flowchart(dependencies, all_tasks, all_original_names)
|
| 345 |
|
| 346 |
else:
|
| 347 |
# Try maximum subset
|
|
|
|
| 351 |
excluded_tasks = set(all_tasks) - set(result)
|
| 352 |
output = f"β οΈ **Circular dependencies detected!**\n\n"
|
| 353 |
output += f"**Maximum executable tasks ({len(result)}/{len(all_tasks)}):**\n"
|
| 354 |
+
|
| 355 |
+
result_display = []
|
| 356 |
for i, task in enumerate(result, 1):
|
| 357 |
+
task_display = all_original_names.get(task, display_task_name(task))
|
| 358 |
+
output += f"{i}. {task_display}\n"
|
| 359 |
+
result_display.append(task_display)
|
| 360 |
|
| 361 |
if excluded_tasks:
|
| 362 |
output += f"\n**β Excluded tasks (due to circular dependencies):**\n"
|
| 363 |
for task in sorted(excluded_tasks):
|
| 364 |
+
task_display = all_original_names.get(task, display_task_name(task))
|
| 365 |
+
output += f"β’ {task_display}\n"
|
| 366 |
|
| 367 |
+
json_output = json.dumps(result_display, indent=2)
|
| 368 |
+
gantt = generate_mermaid_gantt(result, all_original_names)
|
| 369 |
+
flowchart = generate_mermaid_flowchart(dependencies, all_tasks, all_original_names)
|
| 370 |
else:
|
| 371 |
output = "β **No solution found!** There might be complex circular dependencies."
|
| 372 |
json_output = "[]"
|
| 373 |
+
gantt = generate_mermaid_gantt([], all_original_names)
|
| 374 |
+
flowchart = generate_mermaid_flowchart(dependencies, all_tasks, all_original_names)
|
| 375 |
|
| 376 |
+
return output, dep_summary, json_output, gantt, flowchart
|
| 377 |
|
| 378 |
except Exception as e:
|
| 379 |
+
return f"β **Error:** {str(e)}", "", "", "", ""
|
| 380 |
|
| 381 |
+
# Example tasks
|
| 382 |
+
example_tasks = """Sleep
|
| 383 |
+
Dinner
|
| 384 |
+
Toothbrushing
|
| 385 |
+
Prep
|
| 386 |
+
Shopping
|
| 387 |
+
Money
|
| 388 |
+
Clean_dining_room
|
| 389 |
+
Cleaning_time"""
|
| 390 |
|
| 391 |
# Create Gradio interface
|
| 392 |
with gr.Blocks(title="Task Dependency Solver", theme=gr.themes.Soft()) as demo:
|
| 393 |
gr.Markdown("""
|
| 394 |
# π Task Dependency Solver
|
| 395 |
|
| 396 |
+
Build task dependencies efficiently with multi-select requirements. Now with **case-insensitive** matching and **Mermaid.js visualizations**!
|
| 397 |
|
| 398 |
**How to use:**
|
| 399 |
+
1. Enter your tasks (one per line or comma-separated)
|
| 400 |
+
2. Select a task, then select all its requirements at once
|
| 401 |
+
3. Click "Add Dependencies" to add them all
|
| 402 |
+
4. Click "Solve Dependencies" to get the optimal execution order with visualizations
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 403 |
""")
|
| 404 |
|
| 405 |
+
# State to store current dependencies
|
| 406 |
+
dependencies_state = gr.State([])
|
| 407 |
+
|
| 408 |
with gr.Row():
|
| 409 |
with gr.Column(scale=1):
|
| 410 |
+
gr.Markdown("### π Step 1: Define Your Tasks")
|
| 411 |
+
tasks_input = gr.Textbox(
|
| 412 |
+
label="Tasks (one per line or comma-separated)",
|
| 413 |
+
placeholder="Enter your tasks like:\nSleep\nDinner\nPrep\nShopping",
|
| 414 |
+
lines=6,
|
| 415 |
+
value=example_tasks,
|
| 416 |
+
info="Case-insensitive: 'Sleep' and 'sleep' are treated the same"
|
| 417 |
)
|
| 418 |
|
| 419 |
+
gr.Markdown("### π Step 2: Build Dependencies")
|
| 420 |
+
task_dropdown = gr.Dropdown(
|
| 421 |
+
label="Select Task",
|
| 422 |
+
choices=[],
|
| 423 |
+
value="",
|
| 424 |
+
info="Choose the task that has requirements"
|
| 425 |
+
)
|
| 426 |
+
|
| 427 |
+
requirements_checkbox = gr.CheckboxGroup(
|
| 428 |
+
label="Select Requirements (can select multiple)",
|
| 429 |
+
choices=[],
|
| 430 |
+
value=[],
|
| 431 |
+
info="Choose what the task requires"
|
| 432 |
+
)
|
| 433 |
+
|
| 434 |
+
with gr.Row():
|
| 435 |
+
add_btn = gr.Button("β Add Dependencies", variant="primary", scale=2)
|
| 436 |
+
clear_all_btn = gr.Button("ποΈ Clear All", variant="secondary", scale=1)
|
| 437 |
+
|
| 438 |
+
add_status = gr.Markdown("")
|
| 439 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 440 |
with gr.Column(scale=1):
|
| 441 |
+
gr.Markdown("### π Current Dependencies")
|
| 442 |
+
dependencies_display = gr.Markdown("No dependencies added yet.")
|
| 443 |
|
| 444 |
+
with gr.Accordion("ποΈ Remove Dependencies", open=False):
|
| 445 |
+
remove_deps = gr.CheckboxGroup(
|
| 446 |
+
label="Select dependencies to remove:",
|
| 447 |
+
choices=[],
|
| 448 |
+
value=[]
|
| 449 |
+
)
|
| 450 |
+
|
| 451 |
+
remove_btn = gr.Button("Remove Selected", variant="secondary")
|
| 452 |
+
remove_status = gr.Markdown("")
|
| 453 |
+
|
| 454 |
+
gr.Markdown("### π Step 3: Solve")
|
| 455 |
+
solve_btn = gr.Button("π― Solve Dependencies", variant="primary", size="lg")
|
| 456 |
+
|
| 457 |
+
with gr.Row():
|
| 458 |
+
with gr.Column(scale=1):
|
| 459 |
+
result_output = gr.Markdown()
|
| 460 |
+
|
| 461 |
+
with gr.Column(scale=1):
|
| 462 |
+
with gr.Accordion("π Analysis", open=False):
|
| 463 |
dep_analysis = gr.Markdown()
|
| 464 |
|
| 465 |
with gr.Accordion("πΎ JSON Output", open=False):
|
| 466 |
+
json_output = gr.Code(language="json")
|
| 467 |
|
| 468 |
+
# Mermaid visualizations
|
| 469 |
+
gr.Markdown("### π Visualizations")
|
| 470 |
+
with gr.Row():
|
| 471 |
+
with gr.Column(scale=1):
|
| 472 |
+
gr.Markdown("#### π
Gantt Chart (Timeline)")
|
| 473 |
+
gantt_chart = gr.Markdown(
|
| 474 |
+
value="gantt\n title Task Execution Timeline\n dateFormat YYYY-MM-DD\n section Tasks\n Click Solve to see timeline : 2024-01-01, 1d"
|
| 475 |
+
)
|
| 476 |
+
|
| 477 |
+
with gr.Column(scale=1):
|
| 478 |
+
gr.Markdown("#### π Dependency Flowchart")
|
| 479 |
+
dependency_flowchart = gr.Markdown(
|
| 480 |
+
value="flowchart TD\n A[Click Solve to see dependencies]"
|
| 481 |
+
)
|
| 482 |
+
|
| 483 |
+
# Examples section
|
| 484 |
+
with gr.Accordion("π Quick Examples", open=False):
|
| 485 |
+
with gr.Row():
|
| 486 |
+
morning_btn = gr.Button("π
Morning Routine")
|
| 487 |
+
cooking_btn = gr.Button("π³ Cooking Tasks")
|
| 488 |
+
project_btn = gr.Button("πΌ Project Tasks")
|
| 489 |
+
|
| 490 |
gr.Markdown("""
|
| 491 |
+
**Click the buttons above to load example task sets!**
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 492 |
|
| 493 |
+
Each example includes pre-defined tasks. After loading, you can quickly build dependencies using the multi-select interface.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 494 |
|
| 495 |
+
**Note:** All matching is case-insensitive. You can mix cases freely!
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 496 |
""")
|
| 497 |
|
| 498 |
+
# Event handlers
|
| 499 |
+
def update_ui_after_tasks_change(tasks_text, current_deps):
|
| 500 |
+
"""Update dropdowns and dependency checkboxes when tasks change."""
|
| 501 |
+
tasks, original_names = parse_tasks(tasks_text)
|
| 502 |
+
|
| 503 |
+
# Create display choices (original casing)
|
| 504 |
+
task_display_choices = [""] + [original_names.get(task, display_task_name(task)) for task in tasks]
|
| 505 |
+
req_display_choices = [original_names.get(task, display_task_name(task)) for task in tasks]
|
| 506 |
+
|
| 507 |
+
# Update dependency removal checkboxes
|
| 508 |
+
checkbox_choices = current_deps if current_deps else []
|
| 509 |
+
|
| 510 |
+
return (
|
| 511 |
+
gr.Dropdown(choices=task_display_choices, value=""), # task_dropdown
|
| 512 |
+
gr.CheckboxGroup(choices=req_display_choices, value=[]), # requirements_checkbox
|
| 513 |
+
gr.CheckboxGroup(choices=checkbox_choices, value=[]) # remove_deps
|
| 514 |
+
)
|
| 515 |
+
|
| 516 |
+
def handle_add_dependencies(task, required_tasks, current_deps):
|
| 517 |
+
"""Handle adding dependencies and update UI."""
|
| 518 |
+
updated_deps, status = add_dependencies(task, required_tasks, current_deps)
|
| 519 |
+
display = format_dependencies_display(updated_deps)
|
| 520 |
+
checkbox_choices = updated_deps if updated_deps else []
|
| 521 |
+
|
| 522 |
+
return (
|
| 523 |
+
updated_deps, # dependencies_state
|
| 524 |
+
display, # dependencies_display
|
| 525 |
+
status, # add_status
|
| 526 |
+
gr.CheckboxGroup(choices=checkbox_choices, value=[]), # remove_deps
|
| 527 |
+
"", # task_dropdown (clear)
|
| 528 |
+
[] # requirements_checkbox (clear)
|
| 529 |
+
)
|
| 530 |
+
|
| 531 |
+
def handle_remove_dependencies(deps_to_remove, current_deps):
|
| 532 |
+
"""Handle removing dependencies and update UI."""
|
| 533 |
+
updated_deps, status = remove_dependency(deps_to_remove, current_deps)
|
| 534 |
+
display = format_dependencies_display(updated_deps)
|
| 535 |
+
checkbox_choices = updated_deps if updated_deps else []
|
| 536 |
+
|
| 537 |
+
return (
|
| 538 |
+
updated_deps, # dependencies_state
|
| 539 |
+
display, # dependencies_display
|
| 540 |
+
status, # remove_status
|
| 541 |
+
gr.CheckboxGroup(choices=checkbox_choices, value=[]) # remove_deps
|
| 542 |
+
)
|
| 543 |
+
|
| 544 |
+
def clear_all_dependencies():
|
| 545 |
+
"""Clear all dependencies."""
|
| 546 |
+
return (
|
| 547 |
+
[], # dependencies_state
|
| 548 |
+
"No dependencies added yet.", # dependencies_display
|
| 549 |
+
"β
All dependencies cleared", # add_status
|
| 550 |
+
gr.CheckboxGroup(choices=[], value=[]) # remove_deps
|
| 551 |
+
)
|
| 552 |
+
|
| 553 |
+
# Example loaders
|
| 554 |
+
def load_morning_example():
|
| 555 |
+
tasks = "Wake_up\nShower\nBrush_teeth\nGet_dressed\nEat_breakfast\nMake_coffee\nLeave_house"
|
| 556 |
+
return tasks, [], "No dependencies added yet.", gr.CheckboxGroup(choices=[], value=[])
|
| 557 |
+
|
| 558 |
+
def load_cooking_example():
|
| 559 |
+
tasks = "Shop_ingredients\nPrep_vegetables\nPreheat_oven\nCook_main_dish\nMake_sauce\nPlate_food\nServe_dinner"
|
| 560 |
+
return tasks, [], "No dependencies added yet.", gr.CheckboxGroup(choices=[], value=[])
|
| 561 |
+
|
| 562 |
+
def load_project_example():
|
| 563 |
+
tasks = "Research\nPlan\nDesign\nDevelop\nTest\nDeploy\nDocument\nReview"
|
| 564 |
+
return tasks, [], "No dependencies added yet.", gr.CheckboxGroup(choices=[], value=[])
|
| 565 |
+
|
| 566 |
+
# Wire up events
|
| 567 |
+
tasks_input.change(
|
| 568 |
+
fn=update_ui_after_tasks_change,
|
| 569 |
+
inputs=[tasks_input, dependencies_state],
|
| 570 |
+
outputs=[task_dropdown, requirements_checkbox, remove_deps]
|
| 571 |
+
)
|
| 572 |
+
|
| 573 |
+
add_btn.click(
|
| 574 |
+
fn=handle_add_dependencies,
|
| 575 |
+
inputs=[task_dropdown, requirements_checkbox, dependencies_state],
|
| 576 |
+
outputs=[dependencies_state, dependencies_display, add_status, remove_deps, task_dropdown, requirements_checkbox]
|
| 577 |
+
)
|
| 578 |
+
|
| 579 |
+
remove_btn.click(
|
| 580 |
+
fn=handle_remove_dependencies,
|
| 581 |
+
inputs=[remove_deps, dependencies_state],
|
| 582 |
+
outputs=[dependencies_state, dependencies_display, remove_status, remove_deps]
|
| 583 |
+
)
|
| 584 |
+
|
| 585 |
+
clear_all_btn.click(
|
| 586 |
+
fn=clear_all_dependencies,
|
| 587 |
+
outputs=[dependencies_state, dependencies_display, add_status, remove_deps]
|
| 588 |
+
)
|
| 589 |
+
|
| 590 |
solve_btn.click(
|
| 591 |
+
fn=solve_dependencies,
|
| 592 |
+
inputs=[tasks_input, dependencies_state],
|
| 593 |
+
outputs=[result_output, dep_analysis, json_output, gantt_chart, dependency_flowchart]
|
| 594 |
+
)
|
| 595 |
+
|
| 596 |
+
# Example buttons
|
| 597 |
+
morning_btn.click(
|
| 598 |
+
fn=load_morning_example,
|
| 599 |
+
outputs=[tasks_input, dependencies_state, dependencies_display, remove_deps]
|
| 600 |
+
)
|
| 601 |
+
|
| 602 |
+
cooking_btn.click(
|
| 603 |
+
fn=load_cooking_example,
|
| 604 |
+
outputs=[tasks_input, dependencies_state, dependencies_display, remove_deps]
|
| 605 |
+
)
|
| 606 |
+
|
| 607 |
+
project_btn.click(
|
| 608 |
+
fn=load_project_example,
|
| 609 |
+
outputs=[tasks_input, dependencies_state, dependencies_display, remove_deps]
|
| 610 |
)
|
| 611 |
|
| 612 |
+
# Initialize on load
|
| 613 |
demo.load(
|
| 614 |
+
fn=update_ui_after_tasks_change,
|
| 615 |
+
inputs=[tasks_input, dependencies_state],
|
| 616 |
+
outputs=[task_dropdown, requirements_checkbox, remove_deps]
|
| 617 |
)
|
| 618 |
|
| 619 |
if __name__ == "__main__":
|