There has been consistent feedback that P1709 is too big. In the last SG19 meeting I proposed a way to do that, which was to split each chapter into it’s own paper. There was no objection to that so that’s what we’ve done. You can find the 6 drafts that are ready in the attached P1709GraphLibrary.zip. The papers are numbered D9901-D9908 until I can get official numbers assigned.

While I showed 5 potential papers, it has grown to 8 which you can see in the table below an in the Getting Started section of each paper.

There’s been one important development since the last review, where the user no longer needs to create any CPO overloads when using the standard library to define a graph. You can find out about that in D9906 Graph Containers and I’ll cover that in the meeting also.

My hope  is that we can vote the papers out of SG19 that are ready in Thursday’s meeting, so they can be reviewed by LEWG in Tokyo.

Paper	Status	Pages
D9901 Overview & Introduction	Active	7
D9902 Algorithms	Active	17
D9903 Operators	Active	6
D9904 Views	Active	11
D9905 Graph Container Interface	Active	10
D9906 Graph Containers	Active	5
D9907 Adaptors	Future
D9908 Background and Terminology	Future