// ReverseIterateAdjacencyNodes reverse for/range on all adjacency nodes of current node,
// call IterateAction for each iterated node
ReverseIterateAdjacencyNodes reverse for/range on all adjacency nodes of current node,
call IterateAction for each iterated node
// ReverseIterateAdjacencyNodes reverse for / range on all adjacency nodes of current node // call IterateAction for each iterated node
func (g adjacencyListGraph) ReverseIterateAdjacencyNodes(currNode NodeID, action IterateAction) {
	if !g.IsNodeValid(currNode) {
		return
	}
	adjList := g.adjList[currNode]
	for i := len(adjList) - 1; i >= 0; i-- {
		action(adjList[i])
	}
}
func ( g adjacencyListGraph ) ReverseIterateAdjacencyNodes ( currNode NodeID , action IterateAction ) { if ! g . IsNodeValid ( currNode ) { return } adjList := g . adjList [ currNode ] for i := len ( adjList ) - 1 ; i >= 0 ; i -- { action ( adjList [ i ] ) } }
ReverseIterateAdjacencyNodes reverse for/range on all adjacency nodes of current node,
call IterateAction for each iterated node
ReverseIterateAdjacencyNodes reverse for / range on all adjacency nodes of current node call IterateAction for each iterated node