Head's Up! These forums are read-only. All users and content have migrated. Please join us at community.neo4j.com.
03-09-2019 06:27 AM
Hi all together,
Neo4j has been on my "needs a second look" list for quite a while, I finally thought I found a toy project, which might be a good fit. However as I looked for graph algorithms, implemented in Neo4j I couldn't find any for my problem.
Basically I am trying to calculate a matching in a bipartite graph (the graph is constructed to be that way).
Of course I found APOC and the like, however these algorithms all are more into: Page prediction and shortest paths.
So my questions basically are:
03-23-2019 05:03 PM
Sounds like more a of a job for networkx (Python e.g.) to me.
Maybe if you were searching for a certain graph out of 1000's statically stored then a database would be nice.
All the sessions of the conference are now available online