Kevin Brown

I read through @DiamondJoseph 's comments. Ran his example code. And looked at the sources. A few thoughts... If the goal is to serialize a graph and then retrieve it...

I don't know why the first 8 commits are in the list above. They are from a previous branch that was already merged.

I made all the changes suggested by @rossbar, except one (thanks for the detailed review. Very helpful). For that one, I'm looking for clarification on what is the intended result....

Help me understand how to wrap this up. I got great feedback from @dschult and @rossbar. I've incorporated most of it by pushing commits into the PR.

How about adding this text to the notes for `write_adjlist`? > If spaces are embedded in the names of nodes, the parser in `read_adjlist` will be confused becasue _space_ is...

Please don't wait on me. I've submitted what I have. I don't have any work pending. Best regards Kevin (brocla) On Tue, Oct 18, 2022, 11:48 AM Ross Barnowski ***@***.***>...

The same error occurs in, - `lexicographical_topological_sort` in `algorithms/graphical.py` - `MappedQueue` in `utils/mapped_queue.py` which also use `heapify`, > TypeError: '

Hello @dschult . I should have included the examples when I had them the first time. Here is how I triggered the `TypeError`. ``` >>> G = nx.path_graph(5, create_using=nx.DiGraph) >>>...

Hi @dschult . Thanks for the clear explanations. It helps me understand the code and the intentions when it was written. Great. I'd like to draft an update to the...

Hello @dschult I started work on adding examples to the doc_string of `MappedQueue`. I was going to explain how to use dictionaries to assign priorities, but I bumped into two...