You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Hi! Just discovered Cozo 2 days ago, and our startup are very much considering using it since it looks very promising. However, the documentation is not as complete as I'd hoped, and I've been trying to figure out how to fix a problem of mine, very similar to #48
Basically, we want to store what we call "actions" in the db. The actions can depend on each other, creating a directed graph, where the direction is from a depending action, say action A, to a depended on action, say action B.
What I would like to do, is to get the remainder of tree from a given node, down to all possible roots.
What im attempting to use is BFS or DFS, however, I'm not quite sure what I can do with the condition. I tried just setting it to true, and cranking the limit, in hopes it would discover ALL possible paths in the tree below our starting node, but that's not the case.
reacted with thumbs up emoji reacted with thumbs down emoji reacted with laugh emoji reacted with hooray emoji reacted with confused emoji reacted with heart emoji reacted with rocket emoji reacted with eyes emoji
-
Hi! Just discovered Cozo 2 days ago, and our startup are very much considering using it since it looks very promising. However, the documentation is not as complete as I'd hoped, and I've been trying to figure out how to fix a problem of mine, very similar to #48
Basically, we want to store what we call "actions" in the db. The actions can depend on each other, creating a directed graph, where the direction is from a depending action, say action A, to a depended on action, say action B.
What I would like to do, is to get the remainder of tree from a given node, down to all possible roots.
What im attempting to use is BFS or DFS, however, I'm not quite sure what I can do with the condition. I tried just setting it to true, and cranking the limit, in hopes it would discover ALL possible paths in the tree below our starting node, but that's not the case.
What approach can i take to solve this?
My data looks like so
What I've tried is this
Where there's also a path from ['storyboard', 'voiceover', ...] that would lead to script, and from script to sources, but that path isn't explored.
I assume im using the condition wrong, but I cant really tell from the documentation how I'm supposed to utilize it.
Any help is appreciated!
Beta Was this translation helpful? Give feedback.
All reactions