While watching the working session "Wolfram Physics Project: Working Session Wednesday, Apr. 29, 2020 [Finding Black Hole Structures]" on YouTube, I had some questions about what seemed to be errors that may have led to some of the bugs and confusion in the behavior of the CausalConnectionGraph function that was being developed:

• At 2:04:10, the adjacency matrix of graph "ggg" was indeed symmetric, but mistaken to be asymmetric... Wouldn't that be the reason that all edges in the DirectedEdges graph were bidirectional? 1 1 1 0 0, 1 1 1 0 0, 1 1 1 1 0, 0 0 1 1 1, 0 0 0 1 1
• At the same time, self-loops are removed by using SimpleGraph, but that lead to a problem discovered at 2:40:45...
• At 2:40:45, SimpleGraph's removal of multi-edges was seen as a problem, but couldn't the goal of removing self-loops be safely solved by clearing the main diagonal of the adjacency matrix (instead of using SimpleGraph)?