io.improbable.keanu.algorithms.graphtraversal

Class TopologicalSort

java.lang.Object

io.improbable.keanu.algorithms.graphtraversal.TopologicalSort

public class TopologicalSort
extends java.lang.Object

Method Summary

Modifier and Type	Method and Description
static java.util.Map<Vertex,java.util.Set<Vertex>>	mapDependencies(java.util.Collection<? extends Vertex> vertices)
static java.util.List<Vertex>	sort(java.util.Collection<? extends Vertex> vertices) This algorithm returns a linear ordering of vertices such that for every edge uv from vertex u to vertex v; u comes before v in the ordering.

Methods inherited from class java.lang.Object

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

Method Detail

sort

public static java.util.List<Vertex> sort(java.util.Collection<? extends Vertex> vertices)

This algorithm returns a linear ordering of vertices such that for every edge uv from vertex u to vertex v; u comes before v in the ordering.

Parameters:

vertices - the vertices to sort

Returns:

a linear ordering of vertices by order of execution

mapDependencies

public static java.util.Map<Vertex,java.util.Set<Vertex>> mapDependencies(java.util.Collection<? extends Vertex> vertices)