{"action":"created","issue":{"url":"https://api.github.com/repos/jgrapht/jgrapht/issues/437","repository_url":"https://api.github.com/repos/jgrapht/jgrapht","labels_url":"https://api.github.com/repos/jgrapht/jgrapht/issues/437/labels{/name}","comments_url":"https://api.github.com/repos/jgrapht/jgrapht/issues/437/comments","events_url":"https://api.github.com/repos/jgrapht/jgrapht/issues/437/events","html_url":"https://github.com/jgrapht/jgrapht/issues/437","id":259532134,"number":437,"title":"Multigraph should allow adding an edge which is equal to an existing edge","user":{"login":"patric-r","id":10393382,"avatar_url":"https://avatars0.githubusercontent.com/u/10393382?v=4","gravatar_id":"","url":"https://api.github.com/users/patric-r","html_url":"https://github.com/patric-r","followers_url":"https://api.github.com/users/patric-r/followers","following_url":"https://api.github.com/users/patric-r/following{/other_user}","gists_url":"https://api.github.com/users/patric-r/gists{/gist_id}","starred_url":"https://api.github.com/users/patric-r/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/patric-r/subscriptions","organizations_url":"https://api.github.com/users/patric-r/orgs","repos_url":"https://api.github.com/users/patric-r/repos","events_url":"https://api.github.com/users/patric-r/events{/privacy}","received_events_url":"https://api.github.com/users/patric-r/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2017-09-21T15:13:24Z","updated_at":"2017-09-22T08:03:52Z","closed_at":null,"author_association":"NONE","body":"Currently, calling `addEdge()` on a `Multigraph `invokes `containsEdge()` which is based on `equals()/hashCode()` of the edge. If this method returns true, the adding is rejected.\r\n\r\nAs a result you can only use a `Multigraph `with edge instances which are not equal\r\nwhich seems to be an unnecessary limitation for a `Multigraph `(while it's perfect for a `SimpleGraph`)."},"comment":{"url":"https://api.github.com/repos/jgrapht/jgrapht/issues/comments/331379749","html_url":"https://github.com/jgrapht/jgrapht/issues/437#issuecomment-331379749","issue_url":"https://api.github.com/repos/jgrapht/jgrapht/issues/437","id":331379749,"user":{"login":"d-michail","id":15940875,"avatar_url":"https://avatars0.githubusercontent.com/u/15940875?v=4","gravatar_id":"","url":"https://api.github.com/users/d-michail","html_url":"https://github.com/d-michail","followers_url":"https://api.github.com/users/d-michail/followers","following_url":"https://api.github.com/users/d-michail/following{/other_user}","gists_url":"https://api.github.com/users/d-michail/gists{/gist_id}","starred_url":"https://api.github.com/users/d-michail/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/d-michail/subscriptions","organizations_url":"https://api.github.com/users/d-michail/orgs","repos_url":"https://api.github.com/users/d-michail/repos","events_url":"https://api.github.com/users/d-michail/events{/privacy}","received_events_url":"https://api.github.com/users/d-michail/received_events","type":"User","site_admin":false},"created_at":"2017-09-22T08:03:52Z","updated_at":"2017-09-22T08:03:52Z","author_association":"COLLABORATOR","body":"The implementation follows standard definitions in graph theory. It is not a limitation. Try using edge weights (weighted graphs) if you feel that a certain edge is more important than others. "}}
{"actor":{"display_login":"d-michail"}}