◆ GraphSearch_DFS() [1/2]
| game2dai.graph.GraphSearch_DFS.GraphSearch_DFS |
( |
| ) |
|
|
protected |
Prevent creating an object without a graph
◆ GraphSearch_DFS() [2/2]
| game2dai.graph.GraphSearch_DFS.GraphSearch_DFS |
( |
Graph |
graph | ) |
|
Create a search object that uses depth first search algorithm for the given graph.
- Parameters
-
◆ clear()
| void game2dai.graph.GraphSearch_DFS.clear |
( |
| ) |
|
|
private |
Clears all data related to a search so this object can be reused for another search
◆ getExaminedEdges() [1/2]
| GraphEdge[] game2dai.graph.GraphSearch_DFS.getExaminedEdges |
( |
| ) |
|
Get all the edges examined during the search.
- Returns
- edges examined or array size 0 if none found
Implements game2dai.graph.IGraphSearch.
◆ getExaminedEdges() [2/2]
| public< T > T[] game2dai.graph.GraphSearch_DFS.getExaminedEdges |
( |
T[] |
array | ) |
|
|
package |
Get all the edges examined during the search.
The type of each element in the array will be of type Object if the parameter is null otherwise it is T (where T is GraphEdge or any class that extends GraphEdge.
- Parameters
-
| array | the array to populate |
- Returns
- edges examined or array size 0 if none found
Implements game2dai.graph.IGraphSearch.
◆ getRoute() [1/2]
| GraphNode[] game2dai.graph.GraphSearch_DFS.getRoute |
( |
| ) |
|
Get the path found as an array of GraphNode(s) in start->end order
- Returns
- path found or array size 0 if none found
Implements game2dai.graph.IGraphSearch.
◆ getRoute() [2/2]
| public< T > T[] game2dai.graph.GraphSearch_DFS.getRoute |
( |
T[] |
array | ) |
|
|
package |
Get the path found as an array of T(s) in start->end order.
The type of each element in the array will be of type Object if the parameter is null otherwise it is T (where T is GraphNode or any class that extends GraphNode.
- Parameters
-
| array | the array to populate |
- Returns
- path found or array size 0 if none found
Implements game2dai.graph.IGraphSearch.
◆ search() [1/2]
| LinkedList< GraphNode > game2dai.graph.GraphSearch_DFS.search |
( |
int |
startID, |
|
|
int |
targetID |
|
) |
| |
Search for a route from node startID and ends at targetID.
This will return a linkedlist of the nodes that make up the route from start to end order.
If either the start or target node does not exist or if a route can't be found the returned list is empty.
- Parameters
-
| startID | id of the start node |
| targetID | id of the target node |
- Returns
- the route as a list of nodes
Implements game2dai.graph.IGraphSearch.
◆ search() [2/2]
| LinkedList< GraphNode > game2dai.graph.GraphSearch_DFS.search |
( |
int |
startID, |
|
|
int |
targetID, |
|
|
boolean |
remember |
|
) |
| |
Search for a route from node startID and ends at targetID.
This will return a linkedlist of the nodes that make up the route from start to end order.
If either the start or target node does not exist or if a route can't be found the returned list is empty.
- Parameters
-
| startID | id of the start node |
| targetID | id of the target node |
| remember | whether to remember the examined edges. |
- Returns
- the route as a list of nodes
Implements game2dai.graph.IGraphSearch.
◆ examinedEdges
| HashSet<GraphEdge> game2dai.graph.GraphSearch_DFS.examinedEdges |
|
protected |
Used to remember examined edges
◆ route
| LinkedList<GraphNode> game2dai.graph.GraphSearch_DFS.route |
|
protected |
List for routes nodes in order of travel
◆ settledNodes
| HashMap<Integer, Integer> game2dai.graph.GraphSearch_DFS.settledNodes |
|
protected |
Remember the route found to from
◆ stack
| Stack<GraphEdge> game2dai.graph.GraphSearch_DFS.stack |
|
protected |
Stack of graph edges to consider
◆ visited
| HashSet<Integer> game2dai.graph.GraphSearch_DFS.visited |
|
protected |
Used to remember which nodes had been visited
The documentation for this class was generated from the following file:
- /Users/peter/git/ai4games-repos/AI_4_2D_Games/src/game2dai/graph/GraphSearch_DFS.java
