Ontology Browser
›
graph-theory
› Path
Path
Layer 0 — Mathematics
in the
graph-theory
subtree
A sequence v₀, v₁, …, v_k of vertices with each consecutive pair an edge and no vertex repeated.
Related concepts
Graph G = (V, E)
Cycle
Shortest path
Protecting groups (TBS, Boc, benzyl, acetal)
Strategic-bond ranking: ring > stereocenter > C-heteroatom
Needleman-Wunsch DP: dp[i][j] = max(dp[i−1,j−1]+s, dp[i−1,j]+g, dp[i,j−1]+g)
Explore Path on the interactive knowledge graph →