Returns true if the edges in this graph have a direction associated with them. A directed edge is an plain #outEdges(Object) outgoing edge of its plain #source(Object) source, and an plain #inEdges(Object) incoming edge of its plain #target(Object) target. An undirect
()
| 187 | * of each incident node. |
| 188 | */ |
| 189 | boolean isDirected(); |
| 190 | |
| 191 | /** |
| 192 | * Returns true if this graph allows self-loops (edges that connect a node to itself). |
no outgoing calls
no test coverage detected