algo-graph-representations

SKILLWorkflowCommunity
v0.0.0Pavel-KravchenkoUnknownAktualisiert vor 1 Mon.Quelle →

Build graph structures (adjacency matrix/list, edge list) in Python/NumPy for PPI, GRN, and metabolic networks. Use when representing a graph, picking sparse vs dense storage, loading an edge-list file, or prepping for BFS/DFS/Dijkstra/MST.

Community-submitted skill. Not yet reviewed by the Forge team. Full prompt content may not be available.Request review →
4Repo-Sterne
1Clients
1Formate
vor 1 Mon.Letzte Aktualisierung
Skill
AutorPavel-Kravchenko
Version0.0.0
LizenzUnknown
KategorieWorkflow
Formateskill.md
PromptNicht veröffentlicht
Kompatibilität
Claude✓ Unterstützt
Cursor—
Copilot—
ChatGPT—
Gemini—
Über

Build graph structures (adjacency matrix/list, edge list) in Python/NumPy for PPI, GRN, and metabolic networks. Use when representing a graph, picking sparse vs dense storage, loading an edge-list file, or prepping for BFS/DFS/Dijkstra/MST.

Schlagwörter
skillclaude