text: /* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
   * This code is an adaptation of the Lee algorithm's implementation originally included in the STAMP Benchmark
   * by Stanford University.
   *
   * The original copyright notice is included below.
   *
    * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
   * Copyright (C) Stanford University, 2006.  All Rights Reserved.
   * Author: Chi Cao Minh
   *
   * =============================================================================
   *
   * Unless otherwise noted, the following license applies to STAMP files:
   *
   * Copyright (c) 2007, Stanford University
   * All rights reserved.
   *
   * Redistribution and use in source and binary forms, with or without
   * modification, are permitted provided that the following conditions are
   * met:
   *
   *     * Redistributions of source code must retain the above copyright
   *       notice, this list of conditions and the following disclaimer.
   *
   *     * Redistributions in binary form must reproduce the above copyright
   *       notice, this list of conditions and the following disclaimer in
   *       the documentation and/or other materials provided with the
   *       distribution.
   *
   *     * Neither the name of Stanford University nor the names of its
   *       contributors may be used to endorse or promote products derived
   *       from this software without specific prior written permission.
   *
   * THIS SOFTWARE IS PROVIDED BY STANFORD UNIVERSITY ``AS IS'' AND ANY
   * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
   * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
   * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL STANFORD UNIVERSITY BE LIABLE
   * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
   * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
   * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
   * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
   * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
   * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
   * THE POSSIBILITY OF SUCH DAMAGE.
   *
   * =============================================================================
   *
   * router.h
   *
   * =============================================================================
   */
  
  
  #ifndef ROUTER_H
  #define ROUTER_H 1
  
  #include "grid.h"
  #include "maze.h"
  #include "lib/vector.h"
  
  typedef struct router {
      long xCost;
      long yCost;
      long zCost;
      long bendCost;
  } router_t;
  
  typedef struct router_solve_arg {
      router_t* routerPtr;
      maze_t* mazePtr;
      list_t* pathVectorListPtr;
  } router_solve_arg_t;
  
  
  /* =============================================================================
   * router_alloc
   * =============================================================================
   */
  router_t* router_alloc (long xCost, long yCost, long zCost, long bendCost);
  
  
  /* =============================================================================
   * router_free
   * =============================================================================
   */
  void router_free (router_t* routerPtr);
  
  
  /* =============================================================================
   * router_solve
   * =============================================================================
   */
  void router_solve (void* argPtr);
  
  
  #endif /* ROUTER_H */
  
  
  /* =============================================================================
   *
   * End of router.h
   *
   * =============================================================================
   */
  