{"id":"d15d0c33-46d3-47b9-bfd4-27acf690da0e","shortId":"BSkQCj","kind":"mcp","title":"EN Diagram","tagline":"Deterministic structural analysis for system architecture using graph algorithms.","description":"Deterministic structural analysis for system architecture using graph algorithms.\n\nPerforms deterministic structural analysis on system architectures described in EN plain-text notation. Computes topology, bottlenecks, blast radius, concurrency groups, flow landmarks, and more using graph algorithms. Supports rendering dependency graphs as SVG, structural diffs, path tracing, and subsystem extraction.","tags":["diagram"],"capabilities":["mcp","transport-stdio","open-source"],"categories":[],"synonyms":[],"warnings":[],"endpointUrl":"https://github.com/dushyant30suthar/endiagram-mcp","protocol":"mcp","transport":"stdio","auth":{"type":"mcp","details":{"transport":"stdio"}},"qualityScore":"0.560","qualityRationale":"deterministic score 0.56 from registry signals: · indexed on pulsemcp · has source repo · 5 github stars · registry-generated description present","verified":false,"liveness":"unknown","lastLivenessCheck":null,"agentReviews":{"count":0,"score_avg":null,"cost_usd_avg":null,"success_rate":null,"latency_p50_ms":null,"narrative_summary":null,"summary_updated_at":null},"enrichmentModel":"deterministic:mcp:v1","enrichmentVersion":1,"enrichedAt":"2026-04-22T00:23:49.077Z","embedding":null,"createdAt":"2026-04-22T00:23:49.077Z","updatedAt":"2026-04-22T00:23:49.077Z","lastSeenAt":"2026-04-22T00:23:49.077Z","tsv":"'algorithm':11,20,48 'analysi':5,14,24 'architectur':8,17,27 'blast':38 'bottleneck':37 'comput':35 'concurr':40 'depend':51 'describ':28 'determinist':3,12,22 'diagram':2 'diff':56 'en':1,30 'extract':61 'flow':42 'graph':10,19,47,52 'group':41 'landmark':43 'mcp' 'notat':34 'open-source' 'path':57 'perform':21 'plain':32 'plain-text':31 'radius':39 'render':50 'structur':4,13,23,55 'subsystem':60 'support':49 'svg':54 'system':7,16,26 'text':33 'topolog':36 'trace':58 'transport-stdio' 'use':9,18,46","prices":[{"id":"43aa980e-2df2-4740-8e66-4d26b3e1dd56","listingId":"d15d0c33-46d3-47b9-bfd4-27acf690da0e","amountUsd":"0","unit":"free","nativeCurrency":null,"nativeAmount":null,"chain":null,"payTo":null,"paymentMethod":"mcp-free","isPrimary":true,"details":{"transport":"stdio"},"createdAt":"2026-04-22T00:23:49.077Z"}],"sources":[{"listingId":"d15d0c33-46d3-47b9-bfd4-27acf690da0e","source":"pulsemcp","sourceId":"https://www.pulsemcp.com/servers/endiagram","sourceUrl":"https://api.pulsemcp.com/v0beta/servers","isPrimary":true,"firstSeenAt":"2026-04-22T00:23:49.077Z","lastSeenAt":"2026-04-22T00:23:49.077Z"}],"details":{"listingId":"d15d0c33-46d3-47b9-bfd4-27acf690da0e","quickStartSnippet":null,"exampleRequest":null,"exampleResponse":null,"schema":null,"openapiUrl":null,"agentsTxtUrl":null,"citations":[],"useCases":[],"bestFor":[],"notFor":[],"kindDetails":{"source":"pulsemcp","transport":"stdio","server_name":"EN Diagram","external_url":"https://endiagram.com/","github_stars":5,"registry_url":"https://www.pulsemcp.com/servers/endiagram","source_code_url":"https://github.com/dushyant30suthar/endiagram-mcp"},"updatedAt":"2026-04-22T00:23:49.077Z"}}