CtrlK
BlogDocsLog inGet started
Tessl Logo
SkillPublic

networkx

Creates, analyzes, and visualizes complex networks and graphs in Python with NetworkX. Use when working with network/graph data structures, computing graph algorithms (shortest paths, centrality, clustering), detecting communities, generating synthetic networks (random, scale-free, small-world), reading/writing graph file formats, or drawing network topologies. Common applications include social, biological, transportation, and citation networks.

67

Quality

84%

Does it follow best practices?

Run evals on this skill

Adds up to 20 points to the overall score

View guide
SecuritybySnyk

Passed

No findings from the security scan

SKILL.md
Quality
Evals
Security

Quality

Content

67%Weight 40%Scale 1-5

Reviews the quality of instructions and guidance provided to agents. Good implementation is clear, handles edge cases, and produces reliable results.

A well-structured, highly actionable body with executable NetworkX-specific patterns, current-API corrections, and a clear workflow, supported by real one-level-deep reference files. Its main weaknesses are redundancy — a Quick Reference and Resources section that restate prior content — and inline version notes that belong in a dedicated deprecated-APIs section.

Suggestions

Delete or drastically trim the "Quick Reference" section: its Basic Operations, Essential Algorithms, and File I/O blocks duplicate code already shown in Core Capabilities and the workflow, saving ~65 lines with no information loss.

Consolidate the scattered version-sensitive notes (random_tree removal in 3.4, node-link "edges" key since 3.6, pre-3.0 API removals, Python/NetworkX compatibility) into a single "Deprecated APIs / Version Notes" section instead of inline comments and Overview prose.

Cut the "Resources" section that re-describes each reference file, since every section already signals its pointer inline; keep only the external links (official docs, tutorial, gallery, GitHub).

DimensionReasoningScore

Conciseness

The core sections are tight and NetworkX-specific, but the ~65-line "Quick Reference" and the "Resources" section largely restate examples and reference pointers already given inline, and version-sensitive notes ("random_tree was removed in NetworkX 3.4", "since NetworkX 3.6", the 3.7/3.14.1 compatibility lines) are scattered inline rather than consolidated in a deprecated/old-patterns section. This fits "mostly efficient but includes some unnecessary explanation or could be tightened" better than the minor-trim anchor 4.

3 / 5

Actionability

Most code blocks are concrete and executable with real parameters (e.g., the weighted shortest-path example that asserts `path == [1, 2, 5] and length == 2`, `nx.erdos_renyi_graph(n=100, p=0.1, seed=42)`), but some snippets have minor gaps — the Quick Reference uses bare identifiers (`nx.shortest_path(G, source, target)`) and several sections assume an undefined `G`. That places it at "mostly executable guidance with minor gaps", just below copy-paste-ready anchor 5.

4 / 5

Workflow Clarity

The "Common Workflow Pattern" gives a clear 5-step sequence (Create/Load → Examine → Analyze → Visualize → Export) with code per step and a pre-flight analysis contract, and the shortest-path example demonstrates a validate-with-assert habit. However, most checkpoints are implicit rather than explicit validation steps with fix-and-retry feedback loops, so it sits at anchor 4 rather than 5; the destructive/batch cap does not apply since network analysis is non-destructive.

4 / 5

Progressive Disclosure

Good structure against the actual bundle: every section closes with a clearly signaled pointer (e.g., "See `references/algorithms.md` for worked API patterns..."), all six referenced files exist, and references are one level deep (cross-linking only review.md). It falls short of anchor 5 because the ~460-line body inlines substantial API detail (full generator and layout listings, publication-quality plotting) that duplicates what the reference files cover, where the anchor-5 pattern is a lean overview with most bulk pushed to references.

4 / 5

Total

15

/

20

Passed

Description

92%Weight 40%Scale 1-5

Based on the skill's description, can an agent find and select it at the right time? Clear, specific descriptions lead to better discovery.

A strong description in third-person voice that explicitly states what the skill does and when to use it, with concrete trigger phrases and good natural keyword coverage. Its only gap is a handful of missing synonyms and file extensions that would push trigger-term coverage to fully comprehensive.

DimensionReasoningScore

Specificity

"Creates, analyzes, and visualizes complex networks and graphs in Python with NetworkX" plus concrete action phrases like "computing graph algorithms (shortest paths, centrality, clustering), detecting communities, generating synthetic networks (random, scale-free, small-world), reading/writing graph file formats" lists multiple specific concrete actions with comprehensive coverage, matching the anchor-5 example.

5 / 5

Completeness

It clearly answers "what" ("Creates, analyzes, and visualizes complex networks and graphs in Python with NetworkX") and "when" with an explicit "Use when..." clause enumerating concrete triggers ("working with network/graph data structures, computing graph algorithms..., detecting communities..., generating synthetic networks..., reading/writing graph file formats, or drawing network topologies"), directly matching the anchor-5 example pattern.

5 / 5

Trigger Term Quality

Strong natural coverage — "network/graph", "shortest paths", "centrality", "clustering", "communities", "social, biological, transportation, and citation networks", "NetworkX", "Python" — but a few natural terms users would say are missing (e.g., "nodes", "edges", "PageRank", file extensions like .graphml or .edgelist), so it fits anchor 4's "good keyword coverage; a few natural terms missing" rather than the comprehensive anchor 5.

4 / 5

Distinctiveness Conflict Risk

The named library and domain ("in Python with NetworkX", graph algorithms, community detection, graph file formats) carve out a clear niche with distinct triggers and minimal overlap with generic data-processing or document skills.

5 / 5

Total

19

/

20

Passed

Validation

100%

Checks the skill against the spec for correct structure and formatting. All validation checks must pass before discovery and implementation can be scored.

Validation — 16 / 16 Passed

Validation for skill structure

No warnings or errors.

Repository

K-Dense-AI/scientific-agent-skills

Path

skills/networkx/SKILL.md

Reviewed

Table of Contents

Is this your skill?

If you maintain this skill, you can claim it as your own. Once claimed, you can manage eval scenarios, bundle related skills, attach documentation or rules, and ensure cross-agent compatibility.