Every class the graph declares, keyed by name. A later declaration of the same name wins, as it would in R.
Every class the graph declares, keyed by name. A later declaration of the same name wins, as it would in R.