algo-graph-representations

SKILLFlujo de trabajocomunidad
v0.0.0Pavel-KravchenkoUnknownActualizado hace 1 mFuente →

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 →
4Estrellas del repo
1Clientes
1Formatos
hace 1 mÚltima actualización
Skill
AutorPavel-Kravchenko
Versión0.0.0
LicenciaUnknown
CategoríaFlujo de trabajo
Formatosskill.md
PromptNo publicado
Compatibilidad
Claude✓ Compatible
Cursor—
Copilot—
ChatGPT—
Gemini—
Acerca de

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.

Palabras clave
skillclaude