Re: [SANDBOX] Adding one more shortest path algo to Graph?

[Ted Dunning <te...@gmail.com>]

On Tue, May 14, 2013 at 8:55 AM, Rodion Efremov <
rodion.efremov@cs.helsinki.fi> wrote:

> The reason I contact you is that I wanted to make sure that I understand
> the process. (Bare with me, as this is the very first time I contact ANY
> open-source community.) Now, is the following procedure acceptable?
>
> 1. Create an issue I in JIRA with type 'New feature'
> 2. Clean my working dir with 'mvn clean' to get rid of everything
> irrelevant
> 3. Create the patch with 'svn diff > my.patch'
> 4. Attach my.patch to I
> 5. Wait for any response R from the community
> 6. If R is of type 'something is unfunky'
> 7.     Improve local repo
> 8.     Go to step 2
> 9. Celebrate
>

Yes.  This is a fine procedure to follow.  You might be able to economize
some steps regarding the patch creation, but the flavor is correct.

Also, the polarity of the of 6 might be reversed.  I am sure you have it
right in your head.