AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |
Back to Blog
Neo4j sandbox11/17/2023 ![]() If disabled the progress percentage will not be logged. The number of concurrent threads used for running the algorithm.Īn ID that can be provided to more easily track the algorithm’s progress. The name of a graph stored in the catalog.Ĭonfiguration for algorithm-specifics and/or graph filtering.įilter the named graph using the given node labels.įilter the named graph using the given relationship types. ![]() The algorithm treats each relationship as equally important, discarding the value of any relationship weight. The algorithm supports a relationship property to be used as weight, specified via the relationshipWeightProperty configuration parameter. The algorithm treats all selected relationships similarly regardless of their type. The algorithm has the ability to distinguish between relationships of different types. Heterogeneous relationships fully supported. The algorithm treats all selected nodes similarly regardless of their label. The algorithm has the ability to distinguish between nodes of different types. The algorithm ignores the undirectedness of the graph. The algorithm is well-defined on an undirected graph. The algorithm does not run on a directed graph. The algorithm ignores the direction of the graph. The algorithm is well-defined on a directed graph.
0 Comments
Read More
Leave a Reply. |