public class

HashTableHipsterDirectedGraph

extends HashTableHipsterGraph<V, E>
implements HipsterDirectedGraph<V, E>
java.lang.Object
   ↳ es.usc.citius.hipster.extensions.graph.HashTableHipsterGraph<V, E>
     ↳ es.usc.citius.hipster.extensions.graph.HashTableHipsterDirectedGraph<V, E>

Class Overview

Implementation of a HipsterDirectedGraph using a Guava Hash Table.

Summary

[Expand]
Inherited Fields
From class es.usc.citius.hipster.extensions.graph.HashTableHipsterGraph
Public Constructors
HashTableHipsterDirectedGraph()
Public Methods
GraphEdge<V, E> connect(V v1, V v2, E value)
static <V, E> HashTableHipsterDirectedGraph<V, E> create()
Iterable<GraphEdge<V, E>> incomingEdgesOf(V vertex)
Iterable<GraphEdge<V, E>> outgoingEdgesOf(V vertex)
[Expand]
Inherited Methods
From class es.usc.citius.hipster.extensions.graph.HashTableHipsterGraph
From class java.lang.Object
From interface es.usc.citius.hipster.graph.HipsterDirectedGraph
From interface es.usc.citius.hipster.graph.HipsterGraph

Public Constructors

public HashTableHipsterDirectedGraph ()

Public Methods

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

public static HashTableHipsterDirectedGraph<V, E> create ()

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

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