Detect communities using Weakly Connected Components (WCC).

Count {label} nodes, optionally filtered by a property value.

Run a read-only Cypher query against the graph and return matching records.

Execute a read-only Cypher query against the graph. Only SELECT/MATCH queries are allowed — write operations (CREATE, DELETE, SET, MERGE, DROP) are rejected.

Find {label} nodes similar to a query vector (property: {prop}).

Find {edge_type} connections for a given node. Source labels: {sources}. Target labels: {targets}.

Look up a {label} node by its indexed property.

Rank nodes by structural importance using the PageRank algorithm.

Return the full graph schema including node types, edge types, indexes, and statistics.

Search {label} nodes by text content across string properties.

Find the shortest path between two nodes using BFS.

Traverse {edge_type} relationships up to N hops from a start node.

Search the web for information using Google Custom Search.