/*
 * 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>.reversed(): DirectedGraph<T> {
  val reversed = HashDirectedGraph<T>()
  for (vertex in vertices) {
    for (adjacentVertex in getAdjacentVertices(vertex)!!) {
      reversed.put(adjacentVertex, vertex)
    }
  }
  return reversed
}

Add an extension function for DirectedGraph that build a reverse graph
Add an extension function for DirectedGraph that build a reverse graph

MichaelRocks/lightsaber,MichaelRocks/lightsaber