# Graph Matching Algorithms

**URL:** <https://community.neo4j.com/t/graph-matching-algorithms/5602>\
**Category:** Graph Data Science / Graph Analytics\
**Created:** [March 9, 2019, 2:27pm UTC](https://community.neo4j.com/t/graph-matching-algorithms/5602 "2019-03-09T14:27:21Z")\
**Posts on this page:** 2\
**Page:** 1

<div class="post-metadata">

**Author:** ![tilois](https://sea1.discourse-cdn.com/flex021/user_avatar/community.neo4j.com/tilois/32/3618_2.png) [@tilois](https://community.neo4j.com/u/tilois)\
**Post date:** [March 9, 2019, 2:27pm UTC](https://community.neo4j.com/t/graph-matching-algorithms/5602/1 "2019-03-09T14:27:21Z")

</div>

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:

- Am I overlooking something obvious? If so, I am grateful for a hint / link to the right direction
- Are these things best calculated in a graph library outside the database and Neo4j isn't the right tool for the job?

---

<div class="post-metadata">

**Author:** ![fruitfulapproac](https://sea1.discourse-cdn.com/flex021/user_avatar/community.neo4j.com/fruitfulapproac/32/2627_2.png) [@fruitfulapproac](https://community.neo4j.com/u/fruitfulapproac)\
**Post date:** [March 24, 2019, 12:03am UTC](https://community.neo4j.com/t/graph-matching-algorithms/5602/2 "2019-03-24T00:03:07Z")

</div>

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.