com.netflix.nicobar.core.module

Class GraphUtils

java.lang.Object

com.netflix.nicobar.core.module.GraphUtils

public class GraphUtils
extends java.lang.Object

Utilities for managing graphs. Leverages the JGraphT library.

Constructor Summary

Constructors

Constructor and Description
GraphUtils()

Method Summary

Methods

Modifier and Type	Method and Description
static <V> void	addAllVertices(org.jgrapht.DirectedGraph<V,org.jgrapht.graph.DefaultEdge> graph, java.util.Set<V> vertices) Add all of the vertices to the graph without any edges.
static <N> void	addIncomingEdges(org.jgrapht.DirectedGraph<N,org.jgrapht.graph.DefaultEdge> graph, N target, java.util.Set<N> sources) Add dependents on the give target vertex.
static <V> void	addOutgoingEdges(org.jgrapht.DirectedGraph<V,org.jgrapht.graph.DefaultEdge> graph, V source, java.util.Set<V> targets) Add dependencies to the given source vertex.
static <V> void	copyGraph(org.jgrapht.DirectedGraph<V,org.jgrapht.graph.DefaultEdge> sourceGraph, org.jgrapht.DirectedGraph<V,org.jgrapht.graph.DefaultEdge> targetGraph) Copy the source graph into the target graph
static <V> java.util.Set<V>	getIncomingVertices(org.jgrapht.DirectedGraph<V,org.jgrapht.graph.DefaultEdge> graph, V target) Fetch all of the dependents of the given target vertex
static <V> java.util.Set<V>	getLeafVertices(org.jgrapht.DirectedGraph<V,org.jgrapht.graph.DefaultEdge> graph) Find the leave vertices in the graph.
static <V> java.util.Set<V>	getOutgoingVertices(org.jgrapht.DirectedGraph<V,org.jgrapht.graph.DefaultEdge> graph, V source) Fetch all of the dependencies of the given source vertex
static <V> void	removeVertices(org.jgrapht.DirectedGraph<V,org.jgrapht.graph.DefaultEdge> graph, java.util.Set<V> vertices) Removes vertices from graph
static <V> void	swapVertices(org.jgrapht.DirectedGraph<V,org.jgrapht.graph.DefaultEdge> graph, java.util.Map<V,java.util.Set<V>> alternates) replace the vertices in the graph with an alternate set of vertices.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

GraphUtils

public GraphUtils()

Method Detail

swapVertices

public static <V> void swapVertices(org.jgrapht.DirectedGraph<V,org.jgrapht.graph.DefaultEdge> graph,
                    java.util.Map<V,java.util.Set<V>> alternates)

replace the vertices in the graph with an alternate set of vertices.

Parameters:

graph - graph to be mutated

alternates - alternate vertices to insert into the graph. map of vertices to their direct dependents.

addAllVertices

public static <V> void addAllVertices(org.jgrapht.DirectedGraph<V,org.jgrapht.graph.DefaultEdge> graph,
                      java.util.Set<V> vertices)

Add all of the vertices to the graph without any edges. If the the graph already contains any one of the vertices, that vertex is not added.

Parameters:

graph - graph to be mutated

vertices - vertices to add

addOutgoingEdges

public static <V> void addOutgoingEdges(org.jgrapht.DirectedGraph<V,org.jgrapht.graph.DefaultEdge> graph,
                        V source,
                        java.util.Set<V> targets)

Add dependencies to the given source vertex. Whether duplicates are created is dependent on the underlying DirectedGraph implementation.

Parameters:

graph - graph to be mutated

source - source vertex of the new edges

targets - target vertices for the new edges

addIncomingEdges

public static <N> void addIncomingEdges(org.jgrapht.DirectedGraph<N,org.jgrapht.graph.DefaultEdge> graph,
                        N target,
                        java.util.Set<N> sources)

Add dependents on the give target vertex. Whether duplicates are created is dependent on the underlying DirectedGraph implementation.

Parameters:

graph - graph to be mutated

target - target vertex for the new edges

sources - source vertices for the new edges

getIncomingVertices

public static <V> java.util.Set<V> getIncomingVertices(org.jgrapht.DirectedGraph<V,org.jgrapht.graph.DefaultEdge> graph,
                                       V target)

Fetch all of the dependents of the given target vertex

Returns:

mutable snapshot of the source vertices of all incoming edges

getOutgoingVertices

public static <V> java.util.Set<V> getOutgoingVertices(org.jgrapht.DirectedGraph<V,org.jgrapht.graph.DefaultEdge> graph,
                                       V source)

Fetch all of the dependencies of the given source vertex

Returns:

mutable snapshot of the target vertices of all outgoing edges

copyGraph

public static <V> void copyGraph(org.jgrapht.DirectedGraph<V,org.jgrapht.graph.DefaultEdge> sourceGraph,
                 org.jgrapht.DirectedGraph<V,org.jgrapht.graph.DefaultEdge> targetGraph)

Copy the source graph into the target graph

getLeafVertices

public static <V> java.util.Set<V> getLeafVertices(org.jgrapht.DirectedGraph<V,org.jgrapht.graph.DefaultEdge> graph)

Find the leave vertices in the graph. I.E. Vertices that have no outgoing edges

Parameters:

graph - graph to search

Returns:

mutable snapshot of all leaf vertices.

removeVertices

public static <V> void removeVertices(org.jgrapht.DirectedGraph<V,org.jgrapht.graph.DefaultEdge> graph,
                      java.util.Set<V> vertices)

Removes vertices from graph

Parameters:

graph - raph to mutate

vertices - vertices to remove