/*
 * Copyright 2016 Michael Rozumyanskiy
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package io.michaelrocks.lightsaber.processor.graph

import java.util.*

fun <T> DirectedGraph<T>.traverseDepthFirst(
    beforeAdjacent: (T) -> Unit = {},
    afterAdjacent: (T) -> Unit = {}
) {
  val visited = HashSet<T>(size)

  fun traverse(vertex: T) {
    if (visited.add(vertex)) {
      beforeAdjacent(vertex)
      try {
        getAdjacentVertices(vertex)?.forEach { traverse(it) }
      } finally {
        afterAdjacent(vertex)
      }
    }
  }

  vertices.forEach { traverse(it) }
}

Add a generic utility method for depth-first graph traversal
Add a generic utility method for depth-first graph traversal

MichaelRocks/lightsaber,MichaelRocks/lightsaber