Mazes #155
@@ -165,8 +165,8 @@ public class DirectedGraph<U, V>
|
|||||||
{
|
{
|
||||||
Edge<U, V> innerEdge = (Edge<U, V>) edge;
|
Edge<U, V> innerEdge = (Edge<U, V>) edge;
|
||||||
|
|
||||||
// Check that this node actually belongs to this graph instance.
|
// Check that this edge actually belongs to this graph instance.
|
||||||
// Accepting foreign nodes could corrupt the graph's internal state.
|
// Accepting foreign edges could corrupt the graph's internal state.
|
||||||
if (innerEdge.graphEntry.owner() != edges)
|
if (innerEdge.graphEntry.owner() != edges)
|
||||||
{
|
{
|
||||||
throw new IllegalArgumentException("The specified edge does not belong to this graph.");
|
throw new IllegalArgumentException("The specified edge does not belong to this graph.");
|
||||||
|
|||||||
Reference in New Issue
Block a user