Neo4j

jasperblondin · 09-07-2021

Hello! There is a graph of the following form. Nodes: LessonSkill Relations: Lesson requires some skills: (:Lesson)-[:REQUIRES]->(:Skill) Lesson provide only one skill: (:Skill)-[:PROVIDED_BY]->(:Lesson) How can I get all longest paths (chains of le...

jasperblondin · 09-08-2021

Bennu: They are removed. Technically ["L1", "L2"] can't be because L2 requires S9 and S9 it's just provided by L1. In theory, there might be a situation in which the loop is longer. For example, ["L1", "S21", "L21", "S22", "L22", "S23", "L23",...

jasperblondin · 09-08-2021

Bennu: Remove S4 to L7 dependency. I have already fixed my mistake. Hope no one would notice. But you are very careful The current model looks like this: merge (l1:Lesson {id: "L1"}) merge (l2:Lesson {id: "L2"}) merge (l3:Lesson {id: "L3"}) m...

jasperblondin · 09-08-2021

Both solutions work very well. But after checking them on real data, I ran into a problem related to the fact that I incorrectly described the task and built a test case. Each of the lessons will always contain a list of required skills (at least one...

jasperblondin · 09-08-2021

Bennu: Meanwhile, can the solution use Apoc functions? Any rational decisions are welcome!

jasperblondin · 09-08-2021

poornima: In your modification, you have connected L9 back to L1 which means L1 can be completed only by skills attained through L9 but L9 can be completed only by skills attained through L1. Is this right? Almost. The word "only" is superfluo...

Neo4j

User Statistics

User Activity

How can I get all paths to node?

Re: How can I get all paths to node?

Re: How can I get all paths to node?

Re: How can I get all paths to node?

Re: How can I get all paths to node?

Re: How can I get all paths to node?