'commit'

dsRag/static/tree.html

@@ -101,8 +101,10 @@
                     html += '<span style="display:inline-block; width:16px;"></span>';
                 }
                 html += node.title + '</td>';
-                html += '<td>' + (node.prerequisite || '') + '</td>';
+                html += '<td>' + (node.prerequisite || '') + 
-                html += '<td>' + (node.related || '') + '</td>';
+                    (node.isParent && node.parent_id ? '<button onclick="editPrerequisite(\'' + node.id + '\')">维护</button>' : '') + '</td>';
+                html += '<td>' + (node.related || '') + 
+                    (node.isParent && node.parent_id ? '<button onclick="editRelated(\'' + node.id + '\')">维护</button>' : '') + '</td>';
                 html += '</tr>';
 
                 if (node.open && node.children && node.children.length > 0) {
@@ -126,6 +128,32 @@
             }
         }
     });
+
+    // 添加新函数
+    function editPrerequisite(nodeId) {
+        var node = findNodeById(treeData, nodeId);
+        var allNodes = flattenTree(treeData).filter(n => n.id !== nodeId);
+        // 实现多选逻辑
+        console.log('编辑先修知识', nodeId, allNodes);
+    }
+
+    function editRelated(nodeId) {
+        var node = findNodeById(treeData, nodeId);
+        var allNodes = flattenTree(treeData).filter(n => n.id !== nodeId);
+        // 实现多选逻辑
+        console.log('编辑相关知识', nodeId, allNodes);
+    }
+
+    function flattenTree(nodes) {
+        var result = [];
+        nodes.forEach(node => {
+            result.push(node);
+            if (node.children) {
+                result = result.concat(flattenTree(node.children));
+            }
+        });
+        return result;
+    }
 </script>
 </body>
 </html>