Class Blocker Extends ITraversalProvider

bool CanTraverse (

Path	path
GraphNode	node

)

True if node should be able to be traversed by the path.

bool CanTraverse (

Path	path
GraphNode	from
GraphNode	to

)

True if the path can traverse a link between from and to and if to can be traversed itself.

If this method returns true then a call to #CanTraverse(path,to) must also return true. Thus this method is a more flexible version of CanTraverse(Path,GraphNode).

If you only need the functionality for CanTraverse(Path,GraphNode) then you may implement this method by just forwarding it to CanTraverse(Path,GraphNode)

public bool CanTraverse (Path path, GraphNode from, GraphNode to) {
return CanTraverse(path, to);
}


uint GetTraversalCost (

Path	path
GraphNode	node

)

Cost of traversing a given node.

Should return the additional cost for traversing this node. By default if no tags or penalties are used then the traversal cost is zero. A cost of 1000 corresponds roughly to the cost of moving 1 world unit.

HashSet<GraphNode> blockedNodes = new HashSet<GraphNode>()

bool filterDiagonalGridConnections