Number of Edges in an Undirected Graph

[hackl]

The current approach of calculating the number of directed edges in an undirected network is confusing and may lead to misinterpretation. For algorithms involving undirected networks, users are required to manually adjust the edge count using m = network.m / 2, which becomes even more complex when the network contains self-loops. A more intuitive method or clearer documentation could help prevent errors.