colllin · February 12, 2024 18:36
diff --git a/gistfile1.txt b/gistfile1.txt
 - serialization/deserialization symmetry
    - in general need more formatting options OR go to/from a major interchange format and recommend a separate library for every other kind of format in/out. 
    - But need to support at least one text-based in/out so that we can easily print to inspect a graph
 - no `node_index_map()`?  So you have this clunky interface where you can get either the indices or the data but not both
 - `subgraph()` resets node indices
 - `add_nodes_from()` should just be called `add_nodes()`, same for `add_edges_from()`
 - `compose()` accepts an edge map which prevents having multiple edges from one node in the main graph to multiple nodes in the added fragment.  Instead, it should accept an edge list in the same format used by `add_edges_from()`
 - `rx.union()` should accept a merge predicate function to determine which nodes to merge, and/or the attrs of the merged node
 -
	- serialization/deserialization symmetry
	- in general need more formatting options OR go to/from a major interchange format and recommend a separate library for every other kind of format in/out.
	- But need to support at least one text-based in/out so that we can easily print to inspect a graph
	- no `node_index_map()`? So you have this clunky interface where you can get either the indices or the data but not both
	- `subgraph()` resets node indices
	- `add_nodes_from()` should just be called `add_nodes()`, same for `add_edges_from()`
	- `compose()` accepts an edge map which prevents having multiple edges from one node in the main graph to multiple nodes in the added fragment. Instead, it should accept an edge list in the same format used by `add_edges_from()`
	- `rx.union()` should accept a merge predicate function to determine which nodes to merge, and/or the attrs of the merged node
	-