Hi all, SG19 Machine Learning meeting will focus on Graph. We still want to drive graph and stats to completion. Are there any other suggested topics? Thank you.Michael Wong is invitingyou to a scheduled Zoom meeting.Topic: SG19 monthlyTime: 02:00 PM Eastern Time (US and Canada) Every month on the Second Thu,Join from PC, Mac, Linux, iOS or Android:https://iso.zoom.us/j/93084591725?pwd=K3QxZjJlcnljaE13ZWU5cTlLNkx0Zz09 Password: 035530Or iPhone one-tap : US: +13017158592,,93084591725# or +13126266799,,93084591725#Or Telephone: Dial(for higher quality, dial a number based on your current location): US: +1 301 715 8592 or +1 312 626 6799 or +1 346 248 7799 or +1408 638 0968 or +1 646 876 9923 or +1 669 900 6833 or +1 253 215 8782 or 877 853 5247 (Toll Free) Meeting ID: 930 8459 1725 Password: 035530 International numbers available: https://iso.zoom.us/u/agewu4X97Or Skype for Business (Lync): https://iso.zoom.us/skype/93084591725Agenda:1. Opening and introductionsThe ISO Code of conduct:https://www.iso.org/files/live/sites/isoorg/files/store/en/PUB100397.pdfIEC Code of Conduct:https://www.iec.ch/basecamp/iec-code-conduct-technical-workISO patent policy.https://isotc.iso.org/livelink/livelink/fetch/2000/2122/3770791/Common_Policy.htm?nodeid=6344764&vernum=-2The WG21 Practices and Procedures and Code of Conduct:https://isocpp.org/std/standing-documents/sd-4-wg21-practices-and-procedures1.1 Roll call of participants
Phil Ratzloff, Andrew Lumsdaine, Chris Ryan.. Nathan Owens. Oliver Rosten, Richard Dosselmann, Sam Obeng, Scott McMillan, Michael Wong, Rene Rivera
1.2 Adopt agenda1.3 Approve minutes from previous meeting, and approve publishing previously approved minutes to ISOCPP.org1.4 Action items from previous meetings2. Main issues (125 min)2.1 General logisticsMeeting plan, focus on one paper per meeting but does not preclude otherpaper updates:CPPCON minutes:https://wiki.edg.com/bin/view/Wg21virtual2022-07/SG14Apr 13: Graph
May 11: Stats
June 15: Varna F2F (cancelled)
July 13: Matrix
Aug 10: Graph
Sep 14: Stats
Oct 12: Matrix
Nov 9: Graph
ISO meeting statusfuture C++ Std meetings2.2 Paper reviews2.2.1: ML topics2.2.1.1 Graph Proposal Phil Ratsloff et alLatest paper:Here’s a link to the paper (different than the previous paper reviewed).There are some additional updates I’m planning on making before the meeting.https://docs.google.com/document/d/1OpH-xxRri7tJTtJJIZTYmSHkkrZJkdBwm9zJ7LqolfQ/edit?usp=sharingD1709R4:
aim for Kona
1.2
Graph algorithm
Views
adaptors with cpo
goal for edge list: very useful utility class, lots of graph i/o is done with edges
bipartite graphs are extremely useful (e.g. imdb)
is list collection confusing? its arbitrary based on implementation, yes confusing
edge_list is a list, set, map, forward_list
has the current paper in Latex. You'll need to generate the paper
Algorithms follow standard ranges, separated into 3 tiers
T 2, 3 are paper for the future
Is there a reason we have minimum spanning tree algorithms but not minimum spanning arborecence algorithms?
like MST but for directed graphs: yes can be in both directions, may be just a specia;ization
Should we parallelize, accelerate
yes, have a placeholder, execution_policy, allows symmetrical interface if parameter is always there
some like dijkstra's is sequential, so parallel version is delta-stepping
E.g. chu-liu/edmonds'
DFS is inherently sequential
5.2.1 mode accumulator class has ability to compare
agree to not use long name so just percentile (no of_sorted)
5.2.2 covariance accumulator class templates
use typedef because it is a mouthful
common_type_t would reduce worthiness
preconditions of variance needing 2 values, whereas mean requires 1, another one requires 3
decided to not doing a lot of check - what kind of checks? exceptions? optional? expected? at BSI, choose expected
if you violate preconditins, its UB
due to empty ranges
can we say the operator parenthesis been called twice? it is using outside r, so the length is less then length of W, same length as x, y
checking or not: user has to done the right thing, e.e. binary_search
here you just count the number of invocations
A public implementation is available at ...