algo-graph-representations

SKILLWorkflowcommunauté
v0.0.0Pavel-KravchenkoUnknownMis à jour il y a 1 moisSource →

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 →
4Étoiles du dépôt
1Clients
1Formats
il y a 1 moisDernière mise à jour
Skill
AuteurPavel-Kravchenko
Version0.0.0
LicenceUnknown
CatégorieWorkflow
Formatsskill.md
PromptNon publié
Compatibilité
Claude✓ Pris en charge
Cursor—
Copilot—
ChatGPT—
Gemini—
À propos

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.

Mots-clés
skillclaude