![]() Neo4j is a graph database designed for interacting with highly related data, such as relationships you might find in a social graph. shortestPath: The Shortest Path algorithm calculates the shortest (weighted) path between a pair of nodes.getConnectedNodes: find nodes connected by a path, given a criteria.getEdges: find relationships that match a criteria.getNode: find nodes that match a criteria.hasEdge: checks if a connection exists between two given nodes in your graph.contains: checks if your graph contains a given value.removeEdge: removes edges between two given vertices in your graph.removeNode: removes vertices from your graph.addEdge: creates edges between two given vertices in your graph.Like any other data store, some common operations that can be performed on a graph are: It can be a one way relationship o r a two-way relationship, but it must be explicitly stated. Un-directed graph: The relationship exists in both directions.ĭirected graph: The relationships are based on the direction of the edges.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |