代写代考 package finalproject;

package finalproject;

import finalproject.system.Tile;

Copyright By PowCoder代写 加微信 powcoder

import java.util.ArrayList;
import java.util.HashMap;
import java.util.LinkedList;

public abstract class PathFindingService {
Tile source;

public PathFindingService(Tile start) {
this.source = start;

public abstract void generateGraph();

//TODO level 4: Implement basic dijkstra’s algorithm to find a path to the final unknown destination
public ArrayList findPath(Tile startNode) {
return null;

//TODO level 5: Implement basic dijkstra’s algorithm to path find to a known destination
public ArrayList findPath(Tile start, Tile end) {
return null;

//TODO level 5: Implement basic dijkstra’s algorithm to path find to the final destination passing through given waypoints
public ArrayList findPath(Tile start, LinkedList waypoints){
return null;

程序代写 CS代考 加微信: powcoder QQ: 1823890830 Email: powcoder@163.com