blocks|key|1288300|text|您可以像这样创建一个类：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1288301|enum+NodeType
{+Node,+Output+};

class+TreeElement
{
++NodeType+myType;
++union
++{
++++Node+myNode;
++++Output+myOutput;
++}+NodeVariant;
};|code-block|syntax|javascript|1288302|Node和Output类取自您的清单。不同之处在于Node类可以包含一系列TreeElement实例。此列表表示元素的子元素。|offset|length|style|CODE|1288303|entityMap^0|0|0|0|4|5|6|P|4|11|B|0^^$0|@$1|2|3|4|5|6|7|O|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|P|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|Q|8|@$I|R|J|S|K|L]|$I|T|J|U|K|L]|$I|V|J|W|K|L]|$I|X|J|Y|K|L]]|9|@]|A|$]]|$1|M|3|-4|5|6|7|Z|8|@]|9|@]|A|$]]]|N|$]]

You can create a class like this:

<pre><code>enum NodeType
{ Node, Output };

class TreeElement
{
 NodeType myType;
 union
 {
 Node myNode;
 Output myOutput;
 } NodeVariant;
};
</code></pre>

The <code>Node</code> and <code>Output</code> classes are taken from your listing. The difference is that the <code>Node</code> class can contain a list of <code>TreeElement</code> instances. This list represents the element's children.

blocks|key|2697332|text|Composite+pattern在这里可能非常有用。您可以将节点实现为一种容器，它再次保存输出或节点对象。在该链接中，您将看到更多代码片段作为实现提示。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|2697333|entityMap|0|LINK|mutability|MUTABLE|url|http://en.wikipedia.org/wiki/Composite_pattern^0|0|H|0|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@$A|M|B|N|1|O]]|C|$]]|$1|D|3|-4|5|6|7|P|8|@]|9|@]|C|$]]]|E|$F|$5|G|H|I|C|$J|K]]]]

The <a href="http://en.wikipedia.org/wiki/Composite_pattern" rel="nofollow noreferrer">Composite pattern</a> might be quite useful here. You can implement nodes as a sort of container which holds outputs or node objects again. In the link you'll see more code snippets as implementation hint.

blocks|key|911454|text|创建一个Node类，它具有一个值和一个同级数组。同级数组可以是空的，在这种情况下它是一个值节点。该值可能为null，在这种情况下，它是一个关节。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|911455|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|D|8|@]|9|@]|A|$]]|$1|B|3|-4|5|6|7|E|8|@]|9|@]|A|$]]]|C|$]]

Create a Node class which has a value and an array of siblings. The array of siblings may be empty in which case it is a value node. The value may be null in which case it is a joint.

blocks|key|162539|text|看起来你真的需要更多的自由结构而不是一棵树。每个节点可以有多个节点连接到它；每个连接有一个方向。任何节点都可以附加输入或输出。在创建和更新树时，不强制执行循环连接，并且只有一个输入由您决定。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|162540|这些结构可以是多重链表，如下所示：|162541|++++++++++++struct+Node+{
++++++++++++++NodeContentType+type;++//Input,+Output,+None.
++++++++++++++InOutNode*+content;++++//pointer+to+input+or+output
++++++++++++++Link*+links;+++++++++++//pointer+to+first+connection+(if+any),+NULL+if+none.
++++++++++++}

++++++++++++struct+Link+{
++++++++++++++Node*+node;++//node+this+connection+links+to.
++++++++++++++Link*+next;++//pointer+to+next+connection
++++++++++++}|code-block|syntax|javascript|162542|示例树：|162543|+INPUT
+%7C
+root
+%7C
+branch1---leaf2---output2
+%7C
+leaf1
+%7C
+output1|162544|可能是这样的：(顺序显然是错误的…)|162545|++++++++++++Node+root++++=+{+Input,+&input_function,+&link1+};
++++++++++++Link+link1+++=+{+&branch1,+NULL+};
++++++++++++Node+branch1+=+{+None,++NULL,+&link2+};
++++++++++++Link+link2+++=+{+&leaf1,+&link3+};
++++++++++++Link+link3+++=+{+&leaf2,+NULL+};
++++++++++++Node+leaf1+++=+{+Output,+&output_function1,+NULL+};
++++++++++++Node+leaf2+++=+{+Output,+&output_function2,+NULL+};|162546|entityMap^0|0|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|S|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|T|8|@]|9|@]|A|$]]|$1|D|3|E|5|F|7|U|8|@]|9|@]|A|$G|H]]|$1|I|3|J|5|6|7|V|8|@]|9|@]|A|$]]|$1|K|3|L|5|F|7|W|8|@]|9|@]|A|$G|H]]|$1|M|3|N|5|6|7|X|8|@]|9|@]|A|$]]|$1|O|3|P|5|F|7|Y|8|@]|9|@]|A|$G|H]]|$1|Q|3|-4|5|6|7|Z|8|@]|9|@]|A|$]]]|R|$]]

Seems you should really need more freeform structure than a tree.
Each node can have a number of nodes connected to it; each connection has a direction. Any node can have input or output attached. Enforcing no circular connections and only one input would be up to you upon tree creation and update.

The structures could be multiply linked lists and go like this:

<pre><code> struct Node {
 NodeContentType type; //Input, Output, None.
 InOutNode* content; //pointer to input or output
 Link* links; //pointer to first connection (if any), NULL if none.
 }

 struct Link {
 Node* node; //node this connection links to.
 Link* next; //pointer to next connection
 }
</code></pre>

Example tree:

<pre><code> INPUT
 |
 root
 |
 branch1---leaf2---output2
 |
 leaf1
 |
 output1
</code></pre>

could go like this: (order is obviously wrong...)

<pre><code> Node root = { Input, &amp;input_function, &amp;link1 };
 Link link1 = { &amp;branch1, NULL };
 Node branch1 = { None, NULL, &amp;link2 };
 Link link2 = { &amp;leaf1, &amp;link3 };
 Link link3 = { &amp;leaf2, NULL };
 Node leaf1 = { Output, &amp;output_function1, NULL };
 Node leaf2 = { Output, &amp;output_function2, NULL };
</code></pre>

Ive got some data (not that the data actually exists until after I solved this...) I need to be able to manipulate within my program. However I cant work out a suitable structure for storing this in.

The data represents a set of paths and nodes. There is one input (which may in some cases no be present) then a number of paths between nodes ending with outputs (an end may not have an output, but an output is always at the end). Each input, node and output has a position, and the data overall can be manipulated graphically, so whatever structure I use needs to be easy to change the contents of at runtime in potentially unpredictable ways (such as changing the input to an output, and then making another output the input).

I considered using a tree structure where each item had a parent (except root) and a number of children, eg like:

<pre><code>Input
|
node---
| | |
| | Output
| |
| Node---Output
| |---Output
|
Node----Node
| |
Node Output 
</code></pre>

However I can see a number of problems with this such as if there is no input, or its removed / changed / etc...

This is a visual example. The > is an input O nodes and [] outputs. 
<a href="http://unisonmodules.co.uk/wjnewbery/data.png" rel="nofollow noreferrer">http://unisonmodules.co.uk/wjnewbery/data.png</a>

@Everyone suggesting using a tree structure like I already mentioned

If a tree is in fact suitable, how do I overcome the issues where a given set of data doesn't even have an input/root, like say the one below. What happens then? Do I need to totally rebuild the tree if the input node/point/whatever changes (via a remove then add)? How do I do that?

<a href="http://unisonmodules.co.uk/wjnewbery/data2.png" rel="nofollow noreferrer">http://unisonmodules.co.uk/wjnewbery/data2.png</a>

I'll take a look at graphs.

How to represent this "tree" data?

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

我得到了一些数据(直到我解决了这个问题，这些数据才真正存在……)我需要能够在我的程序中进行操作。然而，我不能想出一个合适的结构来存储它。数据表示一组路径和节点。有一个输入(在某些情况下可能不存在)，然后在以输出结尾的节点之间有多个路径(末端可能没有输出，但输出总是在末端)。每个输入、节点和输出都有一个位置，并且整个数据...

问如何表示这个“树”数据？
EN

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问如何表示这个“树”数据？EN