@graphite-atlas/mcp-server 1.0.0

package/dist/tools/mage.js

@@ -0,0 +1,531 @@
+/**
+ * MAGE (Memgraph Advanced Graph Extensions) Algorithm Tools
+ *
+ * Provides production-grade graph algorithms using Memgraph's MAGE library.
+ * https://memgraph.com/docs/advanced-algorithms
+ */
+import { z } from 'zod';
+export function createMAGETools(client) {
+    return [
+        // PageRank - Production grade
+        {
+            name: 'mage_pagerank',
+            description: `Calculate PageRank using Memgraph's MAGE library (production-grade implementation).
+
+PageRank identifies the most influential nodes based on the quality and quantity of connections. A node is important if important nodes point to it.
+
+Use cases:
+- Find most influential people in the organization
+- Identify critical processes
+- Discover authoritative information sources
+- Rank systems by importance
+
+NOTE: Requires MAGE library to be installed in your Memgraph instance.
+Install with: CALL mage.load("pagerank") or install MAGE query modules.`,
+            inputSchema: {
+                type: 'object',
+                properties: {
+                    atlas_id: {
+                        type: 'string',
+                        description: 'The atlas to analyze',
+                    },
+                    limit: {
+                        type: 'number',
+                        description: 'Number of top nodes to return (default: 20)',
+                        minimum: 1,
+                        maximum: 100,
+                    },
+                    damping_factor: {
+                        type: 'number',
+                        description: 'PageRank damping factor (default: 0.85)',
+                        minimum: 0,
+                        maximum: 1,
+                    },
+                    stop_epsilon: {
+                        type: 'number',
+                        description: 'Convergence threshold (default: 0.01)',
+                    },
+                },
+                required: ['atlas_id'],
+            },
+            async execute(args) {
+                const schema = z.object({
+                    atlas_id: z.string(),
+                    limit: z.number().min(1).max(100).optional().default(20),
+                    damping_factor: z.number().min(0).max(1).optional().default(0.85),
+                    stop_epsilon: z.number().optional().default(0.01),
+                });
+                const { atlas_id, limit, damping_factor, stop_epsilon } = schema.parse(args);
+                // Run MAGE PageRank algorithm
+                // Note: Requires MAGE library installed in Memgraph
+                const query = `
+          CALL pagerank.rank() YIELD node, rank
+          WITH node, rank
+          WHERE node:Point AND node.atlasId = $atlasId AND node.deletedAt IS NULL
+          WITH node, rank
+          ORDER BY rank DESC
+          LIMIT $limit
+          RETURN node.id as id,
+                 node.name as name,
+                 node.type as type,
+                 rank
+        `;
+                const results = await client.queryCypher(atlas_id, {
+                    query,
+                    parameters: { atlasId: atlas_id, limit },
+                });
+                return {
+                    nodes: results.map((r, index) => ({
+                        rank: index + 1,
+                        id: r.id,
+                        name: r.name,
+                        type: r.type,
+                        pagerank_score: r.rank,
+                    })),
+                    count: results.length,
+                    algorithm: 'pagerank_mage',
+                    parameters: { damping_factor, stop_epsilon },
+                    interpretation: 'Higher PageRank = more influential/authoritative node',
+                };
+            },
+        },
+        // Betweenness Centrality - Production grade
+        {
+            name: 'mage_betweenness_centrality',
+            description: `Calculate betweenness centrality using MAGE (production-grade).
+
+Identifies nodes that act as bridges in the network. High betweenness = critical connector that many paths go through.
+
+Use cases:
+- Find key people connecting different teams
+- Identify bottleneck processes
+- Detect single points of failure
+- Understand information flow gatekeepers
+
+This is the real algorithm with O(n³) complexity - may be slow on large graphs.`,
+            inputSchema: {
+                type: 'object',
+                properties: {
+                    atlas_id: {
+                        type: 'string',
+                        description: 'The atlas to analyze',
+                    },
+                    limit: {
+                        type: 'number',
+                        description: 'Number of top nodes to return (default: 20)',
+                    },
+                    normalized: {
+                        type: 'boolean',
+                        description: 'Normalize scores (default: true)',
+                    },
+                },
+                required: ['atlas_id'],
+            },
+            async execute(args) {
+                const schema = z.object({
+                    atlas_id: z.string(),
+                    limit: z.number().min(1).max(100).optional().default(20),
+                    normalized: z.boolean().optional().default(true),
+                });
+                const { atlas_id, limit, normalized } = schema.parse(args);
+                // Run MAGE Betweenness Centrality
+                // Note: Requires MAGE library installed in Memgraph
+                const query = `
+          CALL betweenness_centrality.get()
+          YIELD node, betweenness_centrality
+          WITH node, betweenness_centrality
+          WHERE node:Point AND node.atlasId = $atlasId AND node.deletedAt IS NULL
+          WITH node, betweenness_centrality
+          ORDER BY betweenness_centrality DESC
+          LIMIT $limit
+          RETURN node.id as id,
+                 node.name as name,
+                 node.type as type,
+                 betweenness_centrality
+        `;
+                const results = await client.queryCypher(atlas_id, {
+                    query,
+                    parameters: { atlasId: atlas_id, limit },
+                });
+                return {
+                    nodes: results.map((r, index) => ({
+                        rank: index + 1,
+                        id: r.id,
+                        name: r.name,
+                        type: r.type,
+                        betweenness_score: r.betweenness_centrality,
+                    })),
+                    count: results.length,
+                    algorithm: 'betweenness_centrality_mage',
+                    parameters: { normalized },
+                    interpretation: 'Higher score = more critical bridge/connector node',
+                };
+            },
+        },
+        // Community Detection (Louvain/Leiden)
+        {
+            name: 'mage_detect_communities',
+            description: `Detect communities/clusters using Leiden algorithm (MAGE).
+
+Identifies naturally forming groups or teams within your organization. Communities are groups of nodes with dense internal connections.
+
+Use cases:
+- Discover informal team structures
+- Identify organizational silos
+- Find collaboration clusters
+- Understand departmental boundaries
+- Detect cross-functional groups
+
+Returns communities as node groups with community IDs.`,
+            inputSchema: {
+                type: 'object',
+                properties: {
+                    atlas_id: {
+                        type: 'string',
+                        description: 'The atlas to analyze',
+                    },
+                    min_community_size: {
+                        type: 'number',
+                        description: 'Minimum nodes per community to include in results (default: 2)',
+                    },
+                },
+                required: ['atlas_id'],
+            },
+            async execute(args) {
+                const schema = z.object({
+                    atlas_id: z.string(),
+                    min_community_size: z.number().optional().default(2),
+                });
+                const { atlas_id, min_community_size } = schema.parse(args);
+                // Run MAGE Louvain Community Detection
+                const query = `
+          CALL louvain.communities()
+          YIELD node, community_id
+          WITH node, community_id
+          WHERE node:Point AND node.atlasId = $atlasId AND node.deletedAt IS NULL
+          WITH community_id, collect(node) as nodeList
+          WHERE size(nodeList) >= $minSize
+          WITH community_id, nodeList,
+               [n IN nodeList | {id: n.id, name: n.name, type: n.type}] as nodes
+          WITH community_id, nodes, size(nodes) as size
+          ORDER BY size DESC
+          RETURN community_id, nodes, size
+        `;
+                const results = await client.queryCypher(atlas_id, {
+                    query,
+                    parameters: { atlasId: atlas_id, minSize: min_community_size },
+                });
+                return {
+                    communities: results.map((r, index) => ({
+                        community_id: r.community_id,
+                        rank: index + 1,
+                        size: r.size,
+                        nodes: r.nodes,
+                    })),
+                    total_communities: results.length,
+                    algorithm: 'leiden_community_detection_mage',
+                    interpretation: 'Communities are groups with dense internal connections. Useful for understanding team structures.',
+                };
+            },
+        },
+        // Weakly Connected Components
+        {
+            name: 'mage_connected_components',
+            description: `Find disconnected subgraphs using Weakly Connected Components (MAGE).
+
+Identifies separate "islands" in your graph - groups of nodes that have no paths to other groups.
+
+Use cases:
+- Find isolated departments with no cross-communication
+- Detect data silos
+- Identify separate business units
+- Discover disconnected processes
+- Quality check: ensure your graph is connected
+
+Returns separate components as groups.`,
+            inputSchema: {
+                type: 'object',
+                properties: {
+                    atlas_id: {
+                        type: 'string',
+                        description: 'The atlas to analyze',
+                    },
+                },
+                required: ['atlas_id'],
+            },
+            async execute(args) {
+                const schema = z.object({
+                    atlas_id: z.string(),
+                });
+                const { atlas_id } = schema.parse(args);
+                // Run MAGE Weakly Connected Components
+                // Note: Requires MAGE library installed in Memgraph
+                const query = `
+          CALL weakly_connected_components.get()
+          YIELD node, component_id
+          WITH node, component_id
+          WHERE node:Point AND node.atlasId = $atlasId AND node.deletedAt IS NULL
+          WITH component_id, collect(node) as nodeList
+          WITH component_id, nodeList,
+               [n IN nodeList | {id: n.id, name: n.name, type: n.type}] as nodes
+          WITH component_id, nodes, size(nodes) as size
+          ORDER BY size DESC
+          RETURN component_id, nodes, size
+        `;
+                const results = await client.queryCypher(atlas_id, {
+                    query,
+                    parameters: { atlasId: atlas_id },
+                });
+                const is_connected = results.length === 1;
+                return {
+                    components: results.map((r, index) => ({
+                        component_id: r.component_id,
+                        rank: index + 1,
+                        size: r.size,
+                        nodes: r.nodes,
+                    })),
+                    total_components: results.length,
+                    is_fully_connected: is_connected,
+                    algorithm: 'weakly_connected_components_mage',
+                    interpretation: is_connected
+                        ? 'Graph is fully connected - all nodes can reach each other.'
+                        : `Graph has ${results.length} disconnected components. These are separate islands with no connections between them.`,
+                };
+            },
+        },
+        // Node Similarity
+        {
+            name: 'mage_node_similarity',
+            description: `Find nodes similar to a given node using MAGE node similarity.
+
+Compares nodes based on their connections. Similar nodes have similar neighbors.
+
+Use cases:
+- Find people with similar roles
+- Identify processes that are structurally similar
+- Discover alternative systems/tools
+- Recommend similar entities
+- Find comparable positions across departments
+
+Returns nodes ranked by similarity score.`,
+            inputSchema: {
+                type: 'object',
+                properties: {
+                    atlas_id: {
+                        type: 'string',
+                        description: 'The atlas to search',
+                    },
+                    node_id: {
+                        type: 'string',
+                        description: 'Reference node to find similar nodes for',
+                    },
+                    limit: {
+                        type: 'number',
+                        description: 'Number of similar nodes to return (default: 10)',
+                    },
+                },
+                required: ['atlas_id', 'node_id'],
+            },
+            async execute(args) {
+                const schema = z.object({
+                    atlas_id: z.string(),
+                    node_id: z.string(),
+                    limit: z.number().min(1).max(50).optional().default(10),
+                });
+                const { atlas_id, node_id, limit } = schema.parse(args);
+                // Run MAGE Node Similarity using Jaccard coefficient
+                const query = `
+          MATCH (target:Point {id: $nodeId, atlasId: $atlasId})
+          WHERE target.deletedAt IS NULL
+          CALL node_similarity.jaccard(target)
+          YIELD node, similarity
+          WITH node, similarity
+          WHERE node:Point AND node.atlasId = $atlasId AND node.deletedAt IS NULL
+            AND node.id <> $nodeId
+          WITH node, similarity
+          ORDER BY similarity DESC
+          LIMIT $limit
+          RETURN node.id as id,
+                 node.name as name,
+                 node.type as type,
+                 similarity
+        `;
+                const results = await client.queryCypher(atlas_id, {
+                    query,
+                    parameters: { atlasId: atlas_id, nodeId: node_id, limit },
+                });
+                return {
+                    reference_node: node_id,
+                    similar_nodes: results.map((r, index) => ({
+                        rank: index + 1,
+                        id: r.id,
+                        name: r.name,
+                        type: r.type,
+                        similarity_score: r.similarity,
+                    })),
+                    count: results.length,
+                    algorithm: 'node_similarity_jaccard_mage',
+                    interpretation: 'Similarity based on shared connections. 1.0 = identical neighbors, 0.0 = no shared neighbors.',
+                };
+            },
+        },
+        // Shortest Path
+        {
+            name: 'mage_shortest_path',
+            description: `Find shortest path between two nodes using MAGE.
+
+Discovers the minimum number of hops needed to connect two entities.
+
+Use cases:
+- "How is Person A connected to Person B?"
+- "What's the chain of command from this role to CEO?"
+- "How does this process connect to that outcome?"
+- "What's the relationship path between these systems?"
+
+Returns the shortest path with all intermediate nodes.`,
+            inputSchema: {
+                type: 'object',
+                properties: {
+                    atlas_id: {
+                        type: 'string',
+                        description: 'The atlas to search',
+                    },
+                    source_id: {
+                        type: 'string',
+                        description: 'Starting node ID',
+                    },
+                    target_id: {
+                        type: 'string',
+                        description: 'Destination node ID',
+                    },
+                },
+                required: ['atlas_id', 'source_id', 'target_id'],
+            },
+            async execute(args) {
+                const schema = z.object({
+                    atlas_id: z.string(),
+                    source_id: z.string(),
+                    target_id: z.string(),
+                });
+                const { atlas_id, source_id, target_id } = schema.parse(args);
+                // Use Memgraph's BFS shortest path
+                const query = `
+          MATCH (source:Point {id: $sourceId, atlasId: $atlasId})
+          MATCH (target:Point {id: $targetId, atlasId: $atlasId})
+          WHERE source.deletedAt IS NULL AND target.deletedAt IS NULL
+          MATCH path = (source)-[:PATH*bfs..15]-(target)
+          WITH path
+          UNWIND nodes(path) as pathNode
+          WITH path, collect({id: pathNode.id, name: pathNode.name, type: pathNode.type}) as path_nodes
+          UNWIND relationships(path) as pathRel
+          WITH path, path_nodes, collect({type: pathRel.name}) as path_relationships
+          WITH path_nodes, path_relationships, size(relationships(path)) as distance
+          RETURN path_nodes, path_relationships, distance
+          LIMIT 1
+        `;
+                const results = await client.queryCypher(atlas_id, {
+                    query,
+                    parameters: {
+                        atlasId: atlas_id,
+                        sourceId: source_id,
+                        targetId: target_id,
+                    },
+                });
+                if (results.length === 0) {
+                    return {
+                        source_id,
+                        target_id,
+                        path_found: false,
+                        message: 'No path exists between these nodes. They are in disconnected components.',
+                    };
+                }
+                const result = results[0];
+                return {
+                    source_id,
+                    target_id,
+                    path_found: true,
+                    distance: result.distance,
+                    path: result.path_nodes,
+                    relationships: result.path_relationships,
+                    algorithm: 'shortest_path_mage',
+                    interpretation: `Shortest path has ${result.distance} hop(s)`,
+                };
+            },
+        },
+        // Degree Centrality
+        {
+            name: 'mage_degree_centrality',
+            description: `Calculate degree centrality using MAGE.
+
+Identifies most connected nodes (nodes with the most direct connections).
+
+Use cases:
+- Find most connected people (social hubs)
+- Identify central processes
+- Discover highly-used systems
+- Find nodes with most dependencies
+
+Returns nodes ranked by number of connections.`,
+            inputSchema: {
+                type: 'object',
+                properties: {
+                    atlas_id: {
+                        type: 'string',
+                        description: 'The atlas to analyze',
+                    },
+                    limit: {
+                        type: 'number',
+                        description: 'Number of top nodes to return (default: 20)',
+                    },
+                    type: {
+                        type: 'string',
+                        description: 'Type of degree: in, out, or both (default: both)',
+                        enum: ['in', 'out', 'both'],
+                    },
+                },
+                required: ['atlas_id'],
+            },
+            async execute(args) {
+                const schema = z.object({
+                    atlas_id: z.string(),
+                    limit: z.number().min(1).max(100).optional().default(20),
+                    type: z.enum(['in', 'out', 'both']).optional().default('both'),
+                });
+                const { atlas_id, limit, type } = schema.parse(args);
+                // Run MAGE Degree Centrality
+                // Note: Requires MAGE library installed in Memgraph
+                const query = `
+          CALL degree_centrality.get()
+          YIELD node, degree
+          WITH node, degree
+          WHERE node:Point AND node.atlasId = $atlasId AND node.deletedAt IS NULL
+          WITH node, degree
+          ORDER BY degree DESC
+          LIMIT $limit
+          RETURN node.id as id,
+                 node.name as name,
+                 node.type as type,
+                 degree
+        `;
+                const results = await client.queryCypher(atlas_id, {
+                    query,
+                    parameters: { atlasId: atlas_id, limit },
+                });
+                return {
+                    nodes: results.map((r, index) => ({
+                        rank: index + 1,
+                        id: r.id,
+                        name: r.name,
+                        type: r.type,
+                        degree: r.degree,
+                    })),
+                    count: results.length,
+                    algorithm: 'degree_centrality_mage',
+                    degree_type: type,
+                    interpretation: 'Higher degree = more direct connections',
+                };
+            },
+        },
+    ];
+}
+//# sourceMappingURL=mage.js.map

package/dist/tools/mage.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mage.js","sourceRoot":"","sources":["../../src/tools/mage.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH,OAAO,EAAE,CAAC,EAAE,MAAM,KAAK,CAAC;AAExB,MAAM,UAAU,eAAe,CAAC,MAA2B;IACzD,OAAO;QACL,8BAA8B;QAC9B;YACE,IAAI,EAAE,eAAe;YACrB,WAAW,EAAE;;;;;;;;;;;wEAWqD;YAClE,WAAW,EAAE;gBACX,IAAI,EAAE,QAAQ;gBACd,UAAU,EAAE;oBACV,QAAQ,EAAE;wBACR,IAAI,EAAE,QAAQ;wBACd,WAAW,EAAE,sBAAsB;qBACpC;oBACD,KAAK,EAAE;wBACL,IAAI,EAAE,QAAQ;wBACd,WAAW,EAAE,6CAA6C;wBAC1D,OAAO,EAAE,CAAC;wBACV,OAAO,EAAE,GAAG;qBACb;oBACD,cAAc,EAAE;wBACd,IAAI,EAAE,QAAQ;wBACd,WAAW,EAAE,yCAAyC;wBACtD,OAAO,EAAE,CAAC;wBACV,OAAO,EAAE,CAAC;qBACX;oBACD,YAAY,EAAE;wBACZ,IAAI,EAAE,QAAQ;wBACd,WAAW,EAAE,uCAAuC;qBACrD;iBACF;gBACD,QAAQ,EAAE,CAAC,UAAU,CAAC;aACvB;YACD,KAAK,CAAC,OAAO,CAAC,IAAI;gBAChB,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;oBACtB,QAAQ,EAAE,CAAC,CAAC,MAAM,EAAE;oBACpB,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC;oBACxD,cAAc,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC;oBACjE,YAAY,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC;iBAClD,CAAC,CAAC;gBAEH,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,cAAc,EAAE,YAAY,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAE7E,8BAA8B;gBAC9B,oDAAoD;gBACpD,MAAM,KAAK,GAAG;;;;;;;;;;;SAWb,CAAC;gBAEF,MAAM,OAAO,GAAG,MAAM,MAAM,CAAC,WAAW,CAAC,QAAQ,EAAE;oBACjD,KAAK;oBACL,UAAU,EAAE,EAAE,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE;iBACzC,CAAC,CAAC;gBAEH,OAAO;oBACL,KAAK,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;wBAChC,IAAI,EAAE,KAAK,GAAG,CAAC;wBACf,EAAE,EAAE,CAAC,CAAC,EAAE;wBACR,IAAI,EAAE,CAAC,CAAC,IAAI;wBACZ,IAAI,EAAE,CAAC,CAAC,IAAI;wBACZ,cAAc,EAAE,CAAC,CAAC,IAAI;qBACvB,CAAC,CAAC;oBACH,KAAK,EAAE,OAAO,CAAC,MAAM;oBACrB,SAAS,EAAE,eAAe;oBAC1B,UAAU,EAAE,EAAE,cAAc,EAAE,YAAY,EAAE;oBAC5C,cAAc,EAAE,uDAAuD;iBACxE,CAAC;YACJ,CAAC;SACF;QAED,4CAA4C;QAC5C;YACE,IAAI,EAAE,6BAA6B;YACnC,WAAW,EAAE;;;;;;;;;;gFAU6D;YAC1E,WAAW,EAAE;gBACX,IAAI,EAAE,QAAQ;gBACd,UAAU,EAAE;oBACV,QAAQ,EAAE;wBACR,IAAI,EAAE,QAAQ;wBACd,WAAW,EAAE,sBAAsB;qBACpC;oBACD,KAAK,EAAE;wBACL,IAAI,EAAE,QAAQ;wBACd,WAAW,EAAE,6CAA6C;qBAC3D;oBACD,UAAU,EAAE;wBACV,IAAI,EAAE,SAAS;wBACf,WAAW,EAAE,kCAAkC;qBAChD;iBACF;gBACD,QAAQ,EAAE,CAAC,UAAU,CAAC;aACvB;YACD,KAAK,CAAC,OAAO,CAAC,IAAI;gBAChB,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;oBACtB,QAAQ,EAAE,CAAC,CAAC,MAAM,EAAE;oBACpB,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC;oBACxD,UAAU,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC;iBACjD,CAAC,CAAC;gBAEH,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,UAAU,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAE3D,kCAAkC;gBAClC,oDAAoD;gBACpD,MAAM,KAAK,GAAG;;;;;;;;;;;;SAYb,CAAC;gBAEF,MAAM,OAAO,GAAG,MAAM,MAAM,CAAC,WAAW,CAAC,QAAQ,EAAE;oBACjD,KAAK;oBACL,UAAU,EAAE,EAAE,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE;iBACzC,CAAC,CAAC;gBAEH,OAAO;oBACL,KAAK,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;wBAChC,IAAI,EAAE,KAAK,GAAG,CAAC;wBACf,EAAE,EAAE,CAAC,CAAC,EAAE;wBACR,IAAI,EAAE,CAAC,CAAC,IAAI;wBACZ,IAAI,EAAE,CAAC,CAAC,IAAI;wBACZ,iBAAiB,EAAE,CAAC,CAAC,sBAAsB;qBAC5C,CAAC,CAAC;oBACH,KAAK,EAAE,OAAO,CAAC,MAAM;oBACrB,SAAS,EAAE,6BAA6B;oBACxC,UAAU,EAAE,EAAE,UAAU,EAAE;oBAC1B,cAAc,EAAE,oDAAoD;iBACrE,CAAC;YACJ,CAAC;SACF;QAED,uCAAuC;QACvC;YACE,IAAI,EAAE,yBAAyB;YAC/B,WAAW,EAAE;;;;;;;;;;;uDAWoC;YACjD,WAAW,EAAE;gBACX,IAAI,EAAE,QAAQ;gBACd,UAAU,EAAE;oBACV,QAAQ,EAAE;wBACR,IAAI,EAAE,QAAQ;wBACd,WAAW,EAAE,sBAAsB;qBACpC;oBACD,kBAAkB,EAAE;wBAClB,IAAI,EAAE,QAAQ;wBACd,WAAW,EAAE,gEAAgE;qBAC9E;iBACF;gBACD,QAAQ,EAAE,CAAC,UAAU,CAAC;aACvB;YACD,KAAK,CAAC,OAAO,CAAC,IAAI;gBAChB,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;oBACtB,QAAQ,EAAE,CAAC,CAAC,MAAM,EAAE;oBACpB,kBAAkB,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;iBACrD,CAAC,CAAC;gBAEH,MAAM,EAAE,QAAQ,EAAE,kBAAkB,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAE5D,uCAAuC;gBACvC,MAAM,KAAK,GAAG;;;;;;;;;;;;SAYb,CAAC;gBAEF,MAAM,OAAO,GAAG,MAAM,MAAM,CAAC,WAAW,CAAC,QAAQ,EAAE;oBACjD,KAAK;oBACL,UAAU,EAAE,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,kBAAkB,EAAE;iBAC/D,CAAC,CAAC;gBAEH,OAAO;oBACL,WAAW,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;wBACtC,YAAY,EAAE,CAAC,CAAC,YAAY;wBAC5B,IAAI,EAAE,KAAK,GAAG,CAAC;wBACf,IAAI,EAAE,CAAC,CAAC,IAAI;wBACZ,KAAK,EAAE,CAAC,CAAC,KAAK;qBACf,CAAC,CAAC;oBACH,iBAAiB,EAAE,OAAO,CAAC,MAAM;oBACjC,SAAS,EAAE,iCAAiC;oBAC5C,cAAc,EAAE,mGAAmG;iBACpH,CAAC;YACJ,CAAC;SACF;QAED,8BAA8B;QAC9B;YACE,IAAI,EAAE,2BAA2B;YACjC,WAAW,EAAE;;;;;;;;;;;uCAWoB;YACjC,WAAW,EAAE;gBACX,IAAI,EAAE,QAAQ;gBACd,UAAU,EAAE;oBACV,QAAQ,EAAE;wBACR,IAAI,EAAE,QAAQ;wBACd,WAAW,EAAE,sBAAsB;qBACpC;iBACF;gBACD,QAAQ,EAAE,CAAC,UAAU,CAAC;aACvB;YACD,KAAK,CAAC,OAAO,CAAC,IAAI;gBAChB,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;oBACtB,QAAQ,EAAE,CAAC,CAAC,MAAM,EAAE;iBACrB,CAAC,CAAC;gBAEH,MAAM,EAAE,QAAQ,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAExC,uCAAuC;gBACvC,oDAAoD;gBACpD,MAAM,KAAK,GAAG;;;;;;;;;;;SAWb,CAAC;gBAEF,MAAM,OAAO,GAAG,MAAM,MAAM,CAAC,WAAW,CAAC,QAAQ,EAAE;oBACjD,KAAK;oBACL,UAAU,EAAE,EAAE,OAAO,EAAE,QAAQ,EAAE;iBAClC,CAAC,CAAC;gBAEH,MAAM,YAAY,GAAG,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC;gBAE1C,OAAO;oBACL,UAAU,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;wBACrC,YAAY,EAAE,CAAC,CAAC,YAAY;wBAC5B,IAAI,EAAE,KAAK,GAAG,CAAC;wBACf,IAAI,EAAE,CAAC,CAAC,IAAI;wBACZ,KAAK,EAAE,CAAC,CAAC,KAAK;qBACf,CAAC,CAAC;oBACH,gBAAgB,EAAE,OAAO,CAAC,MAAM;oBAChC,kBAAkB,EAAE,YAAY;oBAChC,SAAS,EAAE,kCAAkC;oBAC7C,cAAc,EAAE,YAAY;wBAC1B,CAAC,CAAC,4DAA4D;wBAC9D,CAAC,CAAC,aAAa,OAAO,CAAC,MAAM,wFAAwF;iBACxH,CAAC;YACJ,CAAC;SACF;QAED,kBAAkB;QAClB;YACE,IAAI,EAAE,sBAAsB;YAC5B,WAAW,EAAE;;;;;;;;;;;0CAWuB;YACpC,WAAW,EAAE;gBACX,IAAI,EAAE,QAAQ;gBACd,UAAU,EAAE;oBACV,QAAQ,EAAE;wBACR,IAAI,EAAE,QAAQ;wBACd,WAAW,EAAE,qBAAqB;qBACnC;oBACD,OAAO,EAAE;wBACP,IAAI,EAAE,QAAQ;wBACd,WAAW,EAAE,0CAA0C;qBACxD;oBACD,KAAK,EAAE;wBACL,IAAI,EAAE,QAAQ;wBACd,WAAW,EAAE,iDAAiD;qBAC/D;iBACF;gBACD,QAAQ,EAAE,CAAC,UAAU,EAAE,SAAS,CAAC;aAClC;YACD,KAAK,CAAC,OAAO,CAAC,IAAI;gBAChB,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;oBACtB,QAAQ,EAAE,CAAC,CAAC,MAAM,EAAE;oBACpB,OAAO,EAAE,CAAC,CAAC,MAAM,EAAE;oBACnB,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC;iBACxD,CAAC,CAAC;gBAEH,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAExD,qDAAqD;gBACrD,MAAM,KAAK,GAAG;;;;;;;;;;;;;;;SAeb,CAAC;gBAEF,MAAM,OAAO,GAAG,MAAM,MAAM,CAAC,WAAW,CAAC,QAAQ,EAAE;oBACjD,KAAK;oBACL,UAAU,EAAE,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE;iBAC1D,CAAC,CAAC;gBAEH,OAAO;oBACL,cAAc,EAAE,OAAO;oBACvB,aAAa,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;wBACxC,IAAI,EAAE,KAAK,GAAG,CAAC;wBACf,EAAE,EAAE,CAAC,CAAC,EAAE;wBACR,IAAI,EAAE,CAAC,CAAC,IAAI;wBACZ,IAAI,EAAE,CAAC,CAAC,IAAI;wBACZ,gBAAgB,EAAE,CAAC,CAAC,UAAU;qBAC/B,CAAC,CAAC;oBACH,KAAK,EAAE,OAAO,CAAC,MAAM;oBACrB,SAAS,EAAE,8BAA8B;oBACzC,cAAc,EAAE,+FAA+F;iBAChH,CAAC;YACJ,CAAC;SACF;QAED,gBAAgB;QAChB;YACE,IAAI,EAAE,oBAAoB;YAC1B,WAAW,EAAE;;;;;;;;;;uDAUoC;YACjD,WAAW,EAAE;gBACX,IAAI,EAAE,QAAQ;gBACd,UAAU,EAAE;oBACV,QAAQ,EAAE;wBACR,IAAI,EAAE,QAAQ;wBACd,WAAW,EAAE,qBAAqB;qBACnC;oBACD,SAAS,EAAE;wBACT,IAAI,EAAE,QAAQ;wBACd,WAAW,EAAE,kBAAkB;qBAChC;oBACD,SAAS,EAAE;wBACT,IAAI,EAAE,QAAQ;wBACd,WAAW,EAAE,qBAAqB;qBACnC;iBACF;gBACD,QAAQ,EAAE,CAAC,UAAU,EAAE,WAAW,EAAE,WAAW,CAAC;aACjD;YACD,KAAK,CAAC,OAAO,CAAC,IAAI;gBAChB,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;oBACtB,QAAQ,EAAE,CAAC,CAAC,MAAM,EAAE;oBACpB,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE;oBACrB,SAAS,EAAE,CAAC,CAAC,MAAM,EAAE;iBACtB,CAAC,CAAC;gBAEH,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,SAAS,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAE9D,mCAAmC;gBACnC,MAAM,KAAK,GAAG;;;;;;;;;;;;;SAab,CAAC;gBAEF,MAAM,OAAO,GAAG,MAAM,MAAM,CAAC,WAAW,CAAC,QAAQ,EAAE;oBACjD,KAAK;oBACL,UAAU,EAAE;wBACV,OAAO,EAAE,QAAQ;wBACjB,QAAQ,EAAE,SAAS;wBACnB,QAAQ,EAAE,SAAS;qBACpB;iBACF,CAAC,CAAC;gBAEH,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBACzB,OAAO;wBACL,SAAS;wBACT,SAAS;wBACT,UAAU,EAAE,KAAK;wBACjB,OAAO,EAAE,0EAA0E;qBACpF,CAAC;gBACJ,CAAC;gBAED,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;gBAE1B,OAAO;oBACL,SAAS;oBACT,SAAS;oBACT,UAAU,EAAE,IAAI;oBAChB,QAAQ,EAAE,MAAM,CAAC,QAAQ;oBACzB,IAAI,EAAE,MAAM,CAAC,UAAU;oBACvB,aAAa,EAAE,MAAM,CAAC,kBAAkB;oBACxC,SAAS,EAAE,oBAAoB;oBAC/B,cAAc,EAAE,qBAAqB,MAAM,CAAC,QAAQ,SAAS;iBAC9D,CAAC;YACJ,CAAC;SACF;QAED,oBAAoB;QACpB;YACE,IAAI,EAAE,wBAAwB;YAC9B,WAAW,EAAE;;;;;;;;;;+CAU4B;YACzC,WAAW,EAAE;gBACX,IAAI,EAAE,QAAQ;gBACd,UAAU,EAAE;oBACV,QAAQ,EAAE;wBACR,IAAI,EAAE,QAAQ;wBACd,WAAW,EAAE,sBAAsB;qBACpC;oBACD,KAAK,EAAE;wBACL,IAAI,EAAE,QAAQ;wBACd,WAAW,EAAE,6CAA6C;qBAC3D;oBACD,IAAI,EAAE;wBACJ,IAAI,EAAE,QAAQ;wBACd,WAAW,EAAE,kDAAkD;wBAC/D,IAAI,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC;qBAC5B;iBACF;gBACD,QAAQ,EAAE,CAAC,UAAU,CAAC;aACvB;YACD,KAAK,CAAC,OAAO,CAAC,IAAI;gBAChB,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC;oBACtB,QAAQ,EAAE,CAAC,CAAC,MAAM,EAAE;oBACpB,KAAK,EAAE,CAAC,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC;oBACxD,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC;iBAC/D,CAAC,CAAC;gBAEH,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAErD,6BAA6B;gBAC7B,oDAAoD;gBACpD,MAAM,KAAK,GAAG;;;;;;;;;;;;SAYb,CAAC;gBAEF,MAAM,OAAO,GAAG,MAAM,MAAM,CAAC,WAAW,CAAC,QAAQ,EAAE;oBACjD,KAAK;oBACL,UAAU,EAAE,EAAE,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE;iBACzC,CAAC,CAAC;gBAEH,OAAO;oBACL,KAAK,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;wBAChC,IAAI,EAAE,KAAK,GAAG,CAAC;wBACf,EAAE,EAAE,CAAC,CAAC,EAAE;wBACR,IAAI,EAAE,CAAC,CAAC,IAAI;wBACZ,IAAI,EAAE,CAAC,CAAC,IAAI;wBACZ,MAAM,EAAE,CAAC,CAAC,MAAM;qBACjB,CAAC,CAAC;oBACH,KAAK,EAAE,OAAO,CAAC,MAAM;oBACrB,SAAS,EAAE,wBAAwB;oBACnC,WAAW,EAAE,IAAI;oBACjB,cAAc,EAAE,yCAAyC;iBAC1D,CAAC;YACJ,CAAC;SACF;KACF,CAAC;AACJ,CAAC"}

package/dist/tools/paths.d.ts

@@ -0,0 +1,7 @@
+/**
+ * Path (Edge/Relationship) Management Tools
+ */
+import { GraphiteAtlasClient } from '../client.js';
+import { MCPTool } from './index.js';
+export declare function createPathTools(client: GraphiteAtlasClient): MCPTool[];
+//# sourceMappingURL=paths.d.ts.map

package/dist/tools/paths.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"paths.d.ts","sourceRoot":"","sources":["../../src/tools/paths.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAE,mBAAmB,EAAE,MAAM,cAAc,CAAC;AACnD,OAAO,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AAGrC,wBAAgB,eAAe,CAAC,MAAM,EAAE,mBAAmB,GAAG,OAAO,EAAE,CA0PtE"}