That's too late for me!

But I look forward to hearing about it.

On Mon, 16 Sept 2024 at 19:17, Phil Ratzloff <Phil.Ratzloff_at_[hidden]> wrote:

> 4pm – 8pm EDT. It’s in Denver, CO.
>
>
>
>
>
> *From:* Oliver Rosten <oliver.rosten_at_[hidden]>
> *Sent:* Monday, September 16, 2024 2:12 PM
> *To:* sg19_at_[hidden]
> *Cc:* Phil Ratzloff <Phil.Ratzloff_at_[hidden]>
> *Subject:* Re: [isocpp-sg19] P3128r2 Graph Algorithms for SG19 at CppCon
> 2024
>
>
>
> *EXTERNAL*
>
> What time is the meeting on Wed?
>
>
>
> On Mon, 16 Sept 2024 at 15:31, Phil Ratzloff via SG19 <
> sg19_at_[hidden]> wrote:
>
> I’ve attached the P3128r2 Graph Algorithms paper I’ll be reviewing at the
> SG19 meeting this Wednesday at CppCon 2024.
>
>
>
> The main focus will be on Dijkstra Shortest Paths (and Distances), and
> Bellman-Ford Shortest Paths (and Distances).
>
>
>
> The discussion will include investigation of visitors vs. coroutines and
> [spoiler] the addition of visitors to the algorithms.
>
> I also have other items I’d like to discuss with the group.
>
>
>
> --
> SG19 mailing list
> SG19_at_[hidden]
> https://lists.isocpp.org/mailman/listinfo.cgi/sg19
> <https://protect.checkpoint.com/v2/___https://lists.isocpp.org/mailman/listinfo.cgi/sg19___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86MTA3OGEzYTgwMjJhYjNmZTFlMWRjMjY1MGYyYmVhYzc6Njo5NDk4OjM3ODE0MzI0YzEyNGU0MzMxNTlkNjY0NjFkNGRmZjA1MzZiOWNhYWZmZGUxZGUxNDk0YjJmN2NmOTk2Zjc4YzQ6aDpUOk4>
>
>