Returns the hash code for this graph. The hash code of a graph is defined as the hash code of a map from each of the graph's nodes to their adjacent nodes. A reference implementation of this is provided by Graphs#hashCode(Graph). Note that by this definition, two graphs that are equa
()
| 289 | * direction will have the same hash code (but can still be differentiated by {@link #equals}. |
| 290 | */ |
| 291 | @Override |
| 292 | int hashCode(); |
| 293 | } |
no outgoing calls
no test coverage detected