Calmcode - neo4j: query

Query

1 2 3 4 5 6 7 8 9 10

Prev Video

Next Video

Let's now try to find the longest chain of dependencies!

We ended up using this query.

MATCH p=(source:Project)-[:Dependency *1.. {required: "True"}]->(sink:Project)
WHERE LENGTH(p) = 11
RETURN source.name as source, sink.name as sink, p
LIMIT 100

The results were pretty interesting. It seems a lot of machine learning packages from azure have very long dependency chains because they depend on other packages from azure.