diff --git a/src/aggregator/relationship-map.ts b/src/aggregator/relationship-map.ts
index bbfb033..1751a02 100644
--- a/src/aggregator/relationship-map.ts
+++ b/src/aggregator/relationship-map.ts
@@ -53,8 +53,6 @@ const generate_relationship_graph = (event_defs: any[]) => {
 // I probably don't have to generate this intermediate tree,
 // the purpose of it is to help me think through the search strategy
 // Actually, it might be useful as it'll remove problems caused by graph cycles??
-//
-// TODO: Redefine this algorithm - see TODO in index.ts
 const generate_relationship_tree = (
   start_point: string,
   event_relationships: Map<string, string[]>,
@@ -158,8 +156,6 @@ const relationship_map_navigator = (
       [],
     );
 
-    console.log('path', merge_dependencies(paths));
-
     return merge_dependencies(paths);
   };
 };
diff --git a/src/query/index.ts b/src/query/index.ts
index 6390c9a..306d7ae 100644
--- a/src/query/index.ts
+++ b/src/query/index.ts
@@ -40,7 +40,6 @@ export const query_builder: QueryBuilder = {
           this,
         );
 
-        console.log("OUTPUT:", output);
         return output;
       } else {
         return condition_chain_builder.create(this);
@@ -66,7 +65,6 @@ const condition_chain_builder: ConditionChainBuilder = {
   condition_chain: {
     parent: undefined,
     key(item: string) {
-      console.log(item);
       return ConditionBuilder.create(this.parent, item);
     },
     and() {