package

es.usc.citius.hipster.graph

Lightweight graph interfaces and in-memory graph implementations.

Interfaces

GraphEdge<V, E> Hipster graph edge implementation to represent edges (or arcs) of a directed or undirected graph. 
HipsterDirectedGraph<V, E> A simple representation of a directed graph with two methods for retrieving the outgoing edges and the incoming edges for a vertex. 
HipsterGraph<V, E> Basic definition of the read-only methods for a graph in terms of edges and vertices. 
HipsterMutableGraph<V, E> Interface that defines the basic mutable methods to manipulate graphs 

Classes

DirectedEdge<V, E>  
GraphBuilder<V, E>

Graph builder assistant to create a Hipster graph. 

GraphBuilder.Vertex1  
GraphBuilder.Vertex1.Vertex2  
GraphSearchProblem Builder to generate a SearchProblem but using a HipsterGraph. 
GraphSearchProblem.FromVertex<V>  
GraphSearchProblem.FromVertex.CostType<E>  
GraphSearchProblem.FromVertex.CostType.HeuristicType<C extends Comparable<C>>  
GraphSearchProblem.FromVertex.CostType.HeuristicType.Final  
HashBasedHipsterDirectedGraph<V, E> Implementation of a HipsterDirectedGraph using a Guava Hash Table. 
HashBasedHipsterGraph<V, E> Lightweight implementation of an in-memory, mutable graph backed to a HashMap where keys are vertices and edges are GraphEdges  
Pair<E>  
UndirectedEdge<V, E>  
UniqueEdge<V> Dumb class that can be used to generate unique edges for a graph with a value. 
UnorderedPair<E>  

Enums