m.4.4.0.source-code.Bfs Maven / Gradle / Ivy

Go to download
Show more of this group Show more artifacts with this name
Show all versions of srm Show documentation
For interconverting spatial locations between representations
The newest version!
/**
@author David Shen
*/
// SRM SDK Release 4.4.0 - January 21, 2010

// - SRM spec. 4.4

/*
 *                             NOTICE
 * 
 * This software is provided openly and freely for use in representing and
 * interchanging environmental data & databases.
 * 
 * This software was developed for use by the United States Government with
 * unlimited rights.  The software was developed under contract
 * DASG60-02-D-0006 TO-193 by Science Applications International Corporation.
 * The software is unclassified and is deemed as Distribution A, approved
 * for Public Release.
 * 
 * Use by others is permitted only upon the ACCEPTANCE OF THE TERMS AND
 * CONDITIONS, AS STIPULATED UNDER THE FOLLOWING PROVISIONS:
 * 
 *    1. Recipient may make unlimited copies of this software and give
 *       copies to other persons or entities as long as the copies contain
 *       this NOTICE, and as long as the same copyright notices that
 *       appear on, or in, this software remain.
 * 
 *    2. Trademarks. All trademarks belong to their respective trademark
 *       holders.  Third-Party applications/software/information are
 *       copyrighted by their respective owners.
 * 
 *    3. Recipient agrees to forfeit all intellectual property and
 *       ownership rights for any version created from the modification
 *       or adaptation of this software, including versions created from
 *       the translation and/or reverse engineering of the software design.
 * 
 *    4. Transfer.  Recipient may not sell, rent, lease, or sublicense
 *       this software.  Recipient may, however enable another person
 *       or entity the rights to use this software, provided that this
 *       AGREEMENT and NOTICE is furnished along with the software and
 *       /or software system utilizing this software.
 * 
 *       All revisions, modifications, created by the Recipient, to this
 *       software and/or related technical data shall be forwarded by the
 *       Recipient to the Government at the following address:
 * 
 *         SMDC
 *         Attention SEDRIS (TO193) TPOC
 *         P.O. Box 1500
 *         Huntsville, AL  35807-3801
 * 
 *         or via electronic mail to:  [email protected]
 * 
 *    5. No Warranty. This software is being delivered to you AS IS
 *       and there is no warranty, EXPRESS or IMPLIED, as to its use
 *       or performance.
 * 
 *       The RECIPIENT ASSUMES ALL RISKS, KNOWN AND UNKNOWN, OF USING
 *       THIS SOFTWARE.  The DEVELOPER EXPRESSLY DISCLAIMS, and the
 *       RECIPIENT WAIVES, ANY and ALL PERFORMANCE OR RESULTS YOU MAY
 *       OBTAIN BY USING THIS SOFTWARE OR DOCUMENTATION.  THERE IS
 *       NO WARRANTY, EXPRESS OR, IMPLIED, AS TO NON-INFRINGEMENT OF
 *       THIRD PARTY RIGHTS, MERCHANTABILITY, OR FITNESS FOR ANY
 *       PARTICULAR PURPOSE.  IN NO EVENT WILL THE DEVELOPER, THE
 *       UNITED STATES GOVERNMENT OR ANYONE ELSE ASSOCIATED WITH THE
 *       DEVELOPMENT OF THIS SOFTWARE BE HELD LIABLE FOR ANY CONSEQUENTIAL,
 *       INCIDENTAL OR SPECIAL DAMAGES, INCLUDING ANY LOST PROFITS
 *       OR LOST SAVINGS WHATSOEVER.
 */

/*
 * COPYRIGHT 2010, SCIENCE APPLICATIONS INTERNATIONAL CORPORATION.
 *                 ALL RIGHTS RESERVED.
 * 
 */

// SRM_OTHERS_GOES_HERE

package SRM;

import java.util.*;

public class Bfs
{
    private static Bfs _bfs = new Bfs();

    public static Bfs instance()
    {
        return  _bfs;
    }

    public Vector GetConversionPath
    (
        SRM_SRFT_Code source,
        SRM_SRFT_Code destination
    )
    {
        boolean[] visited_node = new boolean[SRM_SRFT_Code._totalEnum+1];
        SRM_SRFT_Code[] parent_node =
                        new SRM_SRFT_Code[SRM_SRFT_Code._totalEnum+1];
        int[]  distance   = new int[SRM_SRFT_Code._totalEnum+1];
        Vector lococentre = new Vector();
        Vector path       = new Vector();
        Vector returnPath = new Vector();
        SRM_SRFT_Code current_node;
        SRM_SRFT_Code node;
        Conversions conv;

        for (int i=0; i<=SRM_SRFT_Code._totalEnum ; i++)
        {
            visited_node[i] = false;
            parent_node[i]  = SRM_SRFT_Code.SRFTCOD_UNSPECIFIED;
            distance[i]     = -1;
        }

        if (source != destination)
        {
            visited_node[source.toInt()] = true;
            distance[source.toInt()]     = 0;
            queue(lococentre, source);

            while (!lococentre.isEmpty())
            {
                current_node = dequeue(lococentre);

                if (current_node == destination)
                {
                    node = current_node;

                    do
                    {
                        queue(path, node);
                        node = parent_node[node.toInt()];
                    } while (node != source);
                    queue(path, node);

                    for (int i=0; i lococentre, SRM_SRFT_Code node)
    {
        lococentre.add(node);
    }

    private SRM_SRFT_Code dequeue(Vector lococentre)
    {
        return ((SRM_SRFT_Code) lococentre.remove(0));
    }
}