Skip to main content
Glama

Algorithm Compare

algorithm_compare
Read-onlyIdempotent

Compare candidate algorithms against the facts of YOUR instance and get a verdict. Pass method names (e.g. ["dijkstra","bellman-ford"]) or a problem description, plus constraints such as {"negative_weights": true, "query": "single_source"}, {"stable": true, "key_type": "integer_small_range"}, {"exact": false, "dimensions": "high"}, {"false_positives_ok": true, "dynamic": "fully_dynamic"}. Each candidate gets satisfied / violated / unknown per constraint, read from a curated table cited to textbooks, papers and library docs; unknown means the table records nothing and is never guessed. Returns the winner (or "conditional" with the unknowns named, or "none_compatible"), each candidate's bounds and when-not advice, and the decisive questions you have not answered that would change the choice.

Input Schema

NameRequiredDescriptionDefault
namesNoMethod names or aliases to compare (2-10), e.g. ["dijkstra", "bellman-ford", "johnson"].
problemNoInstead of names: a problem description; the top curated candidates for it are compared.
constraintsNoFacts about your instance. Keys: negative_weights, negative_cycles, weighted, directed, acyclic, bipartite (booleans); graph_density sparse|dense; query single_pair|single_source|all_pairs; exact, worst_case_guarantee, deterministic, false_positives_ok, online, streaming, in_memory, stable, sorted_input, ordered_queries, approximate_match, parallel, distributed, integer_capacities, preemption, precedence, recall, known_distribution, heuristic_available, continuous_variables, linear, convex, differentiable (booleans); dynamic static|insert_only|fully_dynamic; memory tight|normal; key_type integer_small_range|integer|comparable|string|vector; dimensions low|high; metric euclidean|cosine_or_inner_product|jaccard|hamming|edit_distance|general_metric; pattern_count one|many; scale small|medium|large|huge; machines single|multiple; objective max_lateness|num_late_jobs|total_completion_time|makespan|feasibility|total_cost|max_matching_size|fairness.

Schema Changelog

Changes observed during successful MCP inspections.

  1. First observed

TDQS

A4.6/5.0
Behavior5/5

Does the description disclose side effects, auth requirements, rate limits, or destructive behavior?

Adds rich behavioral context beyond the readOnly/idempotent annotations: results come from a curated table cited to textbooks, papers and library docs, and 'unknown' means the table records nothing and is never guessed. This epistemic-honesty guarantee, plus the note that it returns a 'conditional' verdict with unknowns named or 'none_compatible', is exactly the kind of trait annotations cannot convey.

Agents need to know what a tool does to the world before calling it. Descriptions should go beyond structured annotations to explain consequences.

Conciseness4/5

Is the description appropriately sized, front-loaded, and free of redundancy?

A single dense paragraph with the core purpose front-loaded and zero filler. It is lengthy because it packs in constraint examples and return semantics, but every clause contributes; only the enumeration of example constraint blobs is slightly heavy.

Shorter descriptions cost fewer tokens and are easier for agents to parse. Every sentence should earn its place.

Completeness5/5

Given the tool's complexity, does the description cover enough for an agent to succeed on first attempt?

With no output schema, the description carries the return-value burden and does so fully: winner, 'conditional' with named unknowns, 'none_compatible', per-candidate bounds, when-not advice, and unanswered decisive questions. Combined with the two input modes for zero required params, an agent has everything needed to call and interpret it.

Complex tools with many parameters or behaviors need more documentation. Simple tools need less. This dimension scales expectations accordingly.

Parameters4/5

Does the description clarify parameter syntax, constraints, interactions, or defaults beyond what the schema provides?

Schema coverage is already 100% and the schema enumerates every constraint key, so the baseline is 3. The description goes further by showing how constraints are semantically consumed ('satisfied / violated / unknown per constraint') and by giving worked JSON examples, adding meaning beyond field documentation.

Input schemas describe structure but not intent. Descriptions should explain non-obvious parameter relationships and valid value ranges.

Purpose5/5

Does the description clearly state what the tool does and how it differs from similar tools?

States a specific verb and resource: compare candidate algorithms against the facts of a given instance and return a verdict. It names the two input modes (method names or a problem description) and the output artifacts (satisfied/violated/unknown per constraint), which clearly separates it from siblings like algorithm_find and algorithm_lookup.

Agents choose between tools based on descriptions. A clear purpose with a specific verb and resource helps agents select the right tool.

Usage Guidelines4/5

Does the description explain when to use this tool, when not to, or what alternatives exist?

Explains how to invoke it (pass names, or a problem description, plus constraints formatted as instance facts) with concrete examples for each constraint style. It does not, however, state when to prefer this over algorithm_lookup or algorithm_find when both could apply, so the boundary with siblings is left implicit.

Agents often have multiple tools that could apply. Explicit usage guidance like "use X instead of Y when Z" prevents misuse.

Try in Browser

Glama MCP Gateway

Add one secure layer between your agents and this server.