Find path between nodes

[阚璇]

Hi, everyone. I meet a problem. Given 2 nodes, I want to find all paths between these 2 nodes within certain steps. Is there any method or paper try to do it?

Thanks,

[Patrick Hammer]

Depth first search with a depth bound can be used to solve this problem.

Best regards,

Patrick

Am Fr., 31. Juli 2020 um 23:21 Uhr schrieb 阚璇 <kanxu...@gmail.com>:

Hi, everyone. I meet a problem. Given 2 nodes, I want to find all paths between these 2 nodes within certain steps. Is there any method or paper try to do it?

Thanks,

--
You received this message because you are subscribed to the Google Groups "conceptnet-users" group.
To unsubscribe from this group and stop receiving emails from it, send an email to conceptnet-use...@googlegroups.com.
To view this discussion on the web visit https://groups.google.com/d/msgid/conceptnet-users/5f4f70c4-f114-4a6e-ae08-9cf2fa4419ado%40googlegroups.com.

[Patrick Hammer]

Oops Breadth First Search I meant of course.

[Mark Fallu]

There are a range of algorithms you can use - ab outline of some are here in the neo4j graph book: https://neo4j.com/docs/graph-algorithms/current/labs-algorithms/pathfinding/

You may find it easier to do this type of query in a graph database like neo4j

Cheers

Mark

Sent from my iPhone

On 1 Aug 2020, at 6:12 pm, Patrick Hammer <pat...@gmail.com> wrote:



Oops Breadth First Search I meant of course.

--

You received this message because you are subscribed to the Google Groups "conceptnet-users" group.
To unsubscribe from this group and stop receiving emails from it, send an email to conceptnet-use...@googlegroups.com.

To view this discussion on the web visit https://groups.google.com/d/msgid/conceptnet-users/CA%2BK1R6Wf6iT8j1yv%3DdBQp9cayMiQDAP0TbmNdAk%3DN7RbezFc9w%40mail.gmail.com.