io.improbable.keanu.algorithms.graphtraversal

Class DiscoverGraph

java.lang.Object

io.improbable.keanu.algorithms.graphtraversal.DiscoverGraph

public class DiscoverGraph
extends java.lang.Object

Method Summary

Modifier and Type	Method and Description
static java.util.Set<Vertex>	getEntireGraph(Vertex<?> initialVertex) This algorithm visits all vertices in a graph.

Methods inherited from class java.lang.Object

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

Method Detail

getEntireGraph

public static java.util.Set<Vertex> getEntireGraph(Vertex<?> initialVertex)

This algorithm visits all vertices in a graph. It's memory requirements is on the order of number of vertices in the graph and compute requirements on the order of edges in the graph.

If the graph is very large (i.e. greater than 100k vertices), it will be much faster to keep track of vertices as they are created than to create the graph and then collect it with this method.

Parameters:

initialVertex - starting vertex for graph discovery

Returns:

a set containing EVERY vertex in a graph that the starting vertex is apart of.