feat(optimizer): Implement naive join ordering

[desmondcheongzx]

Implements a naive join orderer that simply takes joins relations arbitrarily (as long as a valid join condition exists).

This is intended as a building block to ensure that our join graphs can correctly reconstruct into logical plans. The PR that will immediately follow this will create an optimization rule that applies naive join ordering. The optimization rule will be hidden behind a config flag, but will allow us to test logical plan reconstruction on all our integration tests.

[codspeed-hq]

CodSpeed Performance Report

Merging #3616 will not alter performance

_{Comparing desmondcheongzx:naive-join-order (4e6d79f) with main (b87e0a3)}

Summary

✅ 27 untouched benchmarks

[codecov]

Codecov Report

Attention: Patch coverage is 92.83820% with 27 lines in your changes missing coverage. Please review.

Project coverage is 77.93%. Comparing base (4567601) to head (4e6d79f).
Report is 45 commits behind head on main.

Files with missing lines	Patch %	Lines
...src/optimization/rules/reorder_joins/join_graph.rs	91.40%	22 Missing ⚠️
.../rules/reorder_joins/naive_left_deep_join_order.rs	95.45%	5 Missing ⚠️

Additional details and impacted files

@@            Coverage Diff             @@
##             main    #3616      +/-   ##
==========================================
+ Coverage   77.69%   77.93%   +0.23%     
==========================================
  Files         710      720      +10     
  Lines       86896    88728    +1832     
==========================================
+ Hits        67513    69149    +1636     
- Misses      19383    19579     +196     

Files with missing lines	Coverage Δ
src/common/scan-info/src/test/mod.rs	38.04% <100.00%> (+0.68%)	⬆️
src/daft-logical-plan/src/test/mod.rs	100.00% <100.00%> (ø)
src/daft-physical-plan/src/test/mod.rs	100.00% <100.00%> (ø)
.../rules/reorder_joins/naive_left_deep_join_order.rs	95.45% <95.45%> (ø)
...src/optimization/rules/reorder_joins/join_graph.rs	94.75% <91.40%> (-3.23%)	⬇️

... and 111 files with indirect coverage changes

[samster25]

instead of the nodes involved, you can implement Iterator to give you the nodes involved.

impl Iterator for JoinOrderTree {
...

}

[desmondcheongzx]

Sounds good! I opted for JoinOrderTree.iter() -> JoinOrderTreeIterator which then implements Iterator by maintaining a stack of Joins/Relations.