II.
LibraryProcess overview
Reference · livelib-process:algorithms-optimization--graph-traversal
specializations/algorithms-optimization/graph-traversal overview
Graph Traversal and Connectivity Analysis - Process for implementing DFS/BFS for various applications (cycle detection, topological sort, connected components, bipartite checking, shortest paths).
Attributes
displayName
specializations/algorithms-optimization/graph-traversal
description
Graph Traversal and Connectivity Analysis - Process for implementing DFS/BFS for various applications
(cycle detection, topological sort, connected components, bipartite checking, shortest paths).
libraryPath
library/specializations/algorithms-optimization/graph-traversal.js
specialization
algorithms-optimization
references
- - Graph Traversal: https://cp-algorithms.com/graph/
usesAgents
- graph-specialist
Outgoing edges
lib_applies_to_domain1
- domain:computer-science·DomainComputer Science
lib_belongs_to_specialization1
- specialization:algorithms-optimization·Specialization
lib_implements_workflow1
- workflow:architecture-decision-record·WorkflowArchitecture Decision Record
lib_involves_role2
- role:backend-engineer·RoleBackend Engineer
- role:computational-scientist·RoleComputational Scientist
lib_requires_skill_area2
- skill-area:dynamic-programming·SkillAreaDynamic Programming
- skill-area:graph-algorithms·SkillAreaGraph Algorithms
uses_agent1
- lib-agent:algorithms-optimization--graph-specialist·LibraryAgentgraph-specialist
Incoming edges
None.