public interface

HipsterDirectedGraph

implements HipsterGraph<V, E>
es.usc.citius.hipster.graph.HipsterDirectedGraph<V, E>
Known Indirect Subclasses

Class Overview

A simple representation of a directed graph with two methods for retrieving the outgoing edges and the incoming edges for a vertex.

Summary

Public Methods
abstract Iterable<GraphEdge<V, E>> incomingEdgesOf(V vertex)
abstract Iterable<GraphEdge<V, E>> outgoingEdgesOf(V vertex)
[Expand]
Inherited Methods
From interface es.usc.citius.hipster.graph.HipsterGraph

Public Methods

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

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