Create a new graph

Add nodes to a graph

Add edges to a graph

Get graph information

List all stored graphs with summary info

Delete a graph from storage

Remove nodes from a graph

Remove edges from a graph

Find shortest path between nodes

Get all neighbors of a node

Set attributes on one or more nodes

Get all attributes of a node

Set attributes on one or more edges

Get all attributes of an edge

Calculate degree centrality for all nodes

Calculate betweenness centrality for all nodes

Find connected components in the graph

Calculate PageRank for all nodes

Detect communities in the graph using Louvain method

Calculate clustering coefficients for all nodes

Calculate comprehensive graph statistics (density, diameter, degree distribution)

Find minimum spanning tree of an undirected graph

Detect cycles in a graph (cycle basis for undirected, DAG check for directed)

Color graph vertices using greedy algorithm

Calculate multiple centrality measures (degree, betweenness, closeness, eigenvector)

Find maximum weight matching in a graph

Calculate maximum flow in a directed graph

Return a topological ordering of a directed acyclic graph

Extract an induced subgraph and store it as a new graph

Compose two graphs into a new graph (union of nodes and edges)

Create a visualization of the graph

Import graph from CSV edge list (format: source,target per line)

Export graph as JSON in node-link format

Build citation network from DOIs using CrossRef API

Analyze author impact metrics including h-index

Find collaboration patterns in citation network

Detect research trends over time

Export citation network as BibTeX format

Recommend papers based on citation network analysis

Resolve DOI to publication metadata using CrossRef API

Trigger a GitHub Actions workflow

Get CI/CD workflow status

Cancel a running workflow

Rerun failed jobs in a workflow

Get DORA metrics for CI/CD performance

Analyze workflow failures with AI-powered insights