First work on Kraken! Basic node tree system re-written from WTS-Language, can output .gv files of the node tree.

src/NodeTree.cpp

@@ -0,0 +1,84 @@
+#include "NodeTree.h"
+
+NodeTree::NodeTree() {
+	parent = NULL;
+	name = "UnnamedNode";
+}
+
+NodeTree::NodeTree(std::string name) {
+	parent = NULL;
+	this->name = name;
+}
+
+NodeTree::~NodeTree() {
+	children.clear();
+}
+
+void NodeTree::setParent(NodeTree* parent) {
+	if (this->parent != NULL) {
+		this->parent->removeChild(this);
+	}
+	this->parent = parent;
+}
+
+NodeTree* NodeTree::getParent() {
+	return parent;
+}
+
+void NodeTree::addChild(NodeTree* child) {
+	if (findChild(child) == -1) 
+		children.push_back(child);
+}
+
+int NodeTree::findChild(NodeTree* child) {
+	for (int i = 0; i < children.size(); i++) {
+		if (children[i] == child) {
+			return i;
+		}
+	}
+	return -1;
+}
+
+void NodeTree::removeChild(int index) {
+	children[index] = NULL;
+	children.erase(children.begin()+index);
+}
+
+void NodeTree::removeChild(NodeTree* child) {
+	int index = findChild(child);
+	if (index != 0) {
+		removeChild(index);
+	}
+}
+
+int NodeTree::size() {
+	int count = 0;
+	for (int i = 0; i < children.size(); i++) {
+		count += children[i]->size();
+	}
+	return 1+count;
+}
+
+NodeTree* NodeTree::get(int index) {
+	return children[index];
+}
+
+std::string NodeTree::getName() {
+	return name;
+}
+
+void NodeTree::setName(std::string name) {
+	this->name = name;
+}
+
+std::string NodeTree::DOTGraphString() {
+	return( "digraph Kraken { \n" + DOTGraphStringHelper() + "}");
+}
+
+std::string NodeTree::DOTGraphStringHelper() {
+	std::string ourDOTRelation = "";
+	for (int i = 0; i < children.size(); i++) {
+		ourDOTRelation += name + " -> " + children[i]->name + ";\n" + children[i]->DOTGraphStringHelper();
+	}
+	return(ourDOTRelation);
+}