PK

PKBytes

HomeLearnTechnology
Explore tracks
Chapter 42: Advanced Tree Algorithms on Graphs
← All DSA chapters

Part VI · Chapter 42

Advanced Tree Algorithms on Graphs
  1. 42.01LCA fundamentals
  2. 42.02Tree distances and paths
    1. Root distances
    2. Distance(u,v)
    3. Path reconstruction
    4. Path sums
    5. Weighted edges
  3. 42.03Euler tours
  4. 42.04Binary lifting extensions
  5. 42.05Tree DP
  6. 42.06Rerooting DP
  7. 42.07Heavy-light decomposition
  8. 42.08Centroid decomposition
  9. 42.09DSU on tree
  10. 42.10Virtual trees
  11. 42.11Tree isomorphism intro
← All DSA chapters

Part VI · Chapter 42

Advanced Tree Algorithms on Graphs
  1. 42.01LCA fundamentals
  2. 42.02Tree distances and paths
    1. Root distances
    2. Distance(u,v)
    3. Path reconstruction
    4. Path sums
    5. Weighted edges
  3. 42.03Euler tours
  4. 42.04Binary lifting extensions
  5. 42.05Tree DP
  6. 42.06Rerooting DP
  7. 42.07Heavy-light decomposition
  8. 42.08Centroid decomposition
  9. 42.09DSU on tree
  10. 42.10Virtual trees
  11. 42.11Tree isomorphism intro
Home/DSA/Advanced Tree Algorithms on Graphs/Tree distances and paths
42.02Intermediate / Advanced5 topics

Tree distances and paths

Part of Chapter 42: Advanced Tree Algorithms on Graphs.

Outline only

The topics below come from the curriculum. Their written explanations and animations have not been published yet.

42.02.1

Root distances

Explanation coming soon.

42.02.2

Distance(u,v)

Explanation coming soon.

42.02.3

Path reconstruction

Explanation coming soon.

42.02.4

Path sums

Explanation coming soon.

42.02.5

Weighted edges

Explanation coming soon.

← Previous · 42.01

LCA fundamentals

Next · 42.03 →

Euler tours

On this page

  • Root distances
  • Distance(u,v)
  • Path reconstruction
  • Path sums
  • Weighted edges