/*
 * 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

fun <T> DirectedGraph<T>.findReachableVertices(fromVertex: T): Set<T> {
  val traversal = DepthFirstTraversal<T>()
  val delegate = AbstractMarkingTraversal.SimpleDelegate<T>()
  traversal.traverse(this, delegate, fromVertex)
  return delegate.getVisitedVertices()
}

Implement a graph algorithms that finds reachable vertices
Implement a graph algorithms that finds reachable vertices

MichaelRocks/lightsaber,MichaelRocks/lightsaber