-
Notifications
You must be signed in to change notification settings - Fork 91
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
issymmetric(::SimpleDiGraph)
not correct
#248
Comments
I agree with you here. I think if we change it, we have to do it, so that it is still true for all undirected graphs. For directed graphs I am not sure if there is an easy way to that so have some default for all directed |
Should it also take into account weights or metadata ? |
Weight maybe, metadata we can't do it anyway in the current state of affairs |
But Graphs.jl itself doesn't have a method for getting the weight of an edge. Best we could do is to add an optional argument |
I think the solution that we currently have in #248 kind of solves this, although certainly there are other ways to handle that. It basically uses the Of course one could argue, that there should be a way to ignore weights/metadata but I am not sure how important that is. perhaps in the future, we can specify that with an additional parameter. |
This dispatches here
Graphs.jl/src/operators.jl
Line 498 in 53cb581
This of course returns false for any digraph, and digraphs can indeed be symmetric.
I don't know how many meanings of$(v, w)$ there is an edge $(w, v)$ .
symmetric
are common in fields using graphs. But wikipedia says this means that for each edgeThe text was updated successfully, but these errors were encountered: