Allow null values for Graphs.Edge about bifurcan HOT 3 CLOSED

Sorry for the late response, I've been traveling. Thanks for catching this, since from or to could also potentially be null I've changed it to this:

public int hashCode() {
      if (hash == -1) {
        hash = Objects.hashCode(from) ^ Objects.hashCode(to) ^ Objects.hashCode(value);
      }
      return hash;
    }

from bifurcan.

There is some overhead with Objects.hash, but I believe my original rationale was to have equivalent hashes for undirected edges. On reflection, however, that doesn't also hold true for the equality check, so it probably makes sense to have DirectedEdge and UndirectedEdge classes.

from bifurcan.

Hey, great thanks for fixing this :-)

BTW: Great library, has been really helpful on a project I'm working on :-)

Just out of interest: Can you tell me the advantage from xoring the different hashCodes over calling Objects#hash? Is it the array allocation?

from bifurcan.