public class

HashBasedHipsterDirectedGraph

extends HashBasedHipsterGraph<V, E>
implements HipsterDirectedGraph<V, E> HipsterMutableGraph<V, E>
java.lang.Object
   ↳ es.usc.citius.hipster.graph.HashBasedHipsterGraph<V, E>
     ↳ es.usc.citius.hipster.graph.HashBasedHipsterDirectedGraph<V, E>

Class Overview

Implementation of a HipsterDirectedGraph using a Guava Hash Table.

Summary

[Expand]
Inherited Fields
From class es.usc.citius.hipster.graph.HashBasedHipsterGraph
Public Constructors
HashBasedHipsterDirectedGraph()
Public Methods
GraphEdge<V, E> buildEdge(V v1, V v2, E value)
static <V, E> HashBasedHipsterDirectedGraph<V, E> create()
Iterable<GraphEdge<V, E>> edges()
Returns a list of the edges in the graph.
Iterable<GraphEdge<V, E>> incomingEdgesOf(V vertex)
Iterable<GraphEdge<V, E>> outgoingEdgesOf(V vertex)
[Expand]
Inherited Methods
From class es.usc.citius.hipster.graph.HashBasedHipsterGraph
From class java.lang.Object
From interface es.usc.citius.hipster.graph.HipsterDirectedGraph
From interface es.usc.citius.hipster.graph.HipsterGraph
From interface es.usc.citius.hipster.graph.HipsterMutableGraph

Public Constructors

public HashBasedHipsterDirectedGraph ()

Public Methods

public GraphEdge<V, E> buildEdge (V v1, V v2, E value)

public static HashBasedHipsterDirectedGraph<V, E> create ()

public Iterable<GraphEdge<V, E>> edges ()

Returns a list of the edges in the graph.

Returns
  • edges of the graph.

public Iterable<GraphEdge<V, E>> incomingEdgesOf (V vertex)

public Iterable<GraphEdge<V, E>> outgoingEdgesOf (V vertex)