commons-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Marco Speranza (Commented) (JIRA)" <>
Subject [jira] [Commented] (SANDBOX-394) Check arguments
Date Sun, 19 Feb 2012 13:58:34 GMT


Marco Speranza commented on SANDBOX-394:

Hi Simo, I agree with you. I have a little question:

To implement these checks, would be useful add a new method to Graph interface, like boolean
containsVertex( Vertex v )  and boolean containsEdge( Edge e ). 
It would be also useful make a refactoring  (for example for the class BaseMutableGraph) and
use that method instead use getAdjacencyList().containsKey( v )  to check that argument.

In this case it's possible to use the methods in the Graph also in every chained method for
every entry point.


> Check arguments
> ---------------
>                 Key: SANDBOX-394
>                 URL:
>             Project: Commons Sandbox
>          Issue Type: Improvement
>          Components: Graph
>            Reporter: Marco Speranza
>            Priority: Minor
> Add the assertion for classes *SourceSelector  and check if the Vertex is contained in
the input Graph before selecting the algorithm to apply

This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators:!default.jspa
For more information on JIRA, see:


View raw message