Skip to content

issymmetric(::SimpleDiGraph) not correct #248

@jlapeyre

Description

@jlapeyre

This dispatches here

issymmetric(g::AbstractGraph) = !is_directed(g)

This of course returns false for any digraph, and digraphs can indeed be symmetric.

I don't know how many meanings of symmetric are common in fields using graphs. But wikipedia says this means that for each edge $(v, w)$ there is an edge $(w, v)$.

Metadata

Metadata

Assignees

No one assigned

    Labels

    bugSomething isn't workinggood first issueGood for newcomers

    Type

    No type

    Projects

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions