public interface

HipsterMutableGraph

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

Class Overview

Interface that defines the basic mutable methods to manipulate graphs

Summary

Public Methods
abstract boolean add(V vertex)
Adds a new vertex to the graph.
abstract Set<V> add(V... vertices)
Adds multiple vertices to the graph.
abstract GraphEdge<V, E> connect(V vertex1, V vertex2, E edgeValue)
Connects to vertices of the graph through an edge
abstract boolean remove(V vertex)
Removes the vertex from the graph
abstract Set<V> remove(V... vertices)
Removes multiple vertices from the graph
[Expand]
Inherited Methods
From interface es.usc.citius.hipster.graph.HipsterGraph

Public Methods

public abstract boolean add (V vertex)

Adds a new vertex to the graph.

Parameters
vertex vertex to be added
Returns
  • true if the vertex was added to the graph, false if the vertex is already present

public abstract Set<V> add (V... vertices)

Adds multiple vertices to the graph.

Parameters
vertices vertices to be added
Returns
  • set with the vertices added

public abstract GraphEdge<V, E> connect (V vertex1, V vertex2, E edgeValue)

Connects to vertices of the graph through an edge

Parameters
vertex1 source vertex
vertex2 target (destination) vertex
edgeValue value of the edge connecting vertex1 and vertex2
Returns

public abstract boolean remove (V vertex)

Removes the vertex from the graph

Parameters
vertex vertex to be removed
Returns
  • true if the vertex was removed, false if the vertex is not present

public abstract Set<V> remove (V... vertices)

Removes multiple vertices from the graph

Parameters
vertices vertices to be removed
Returns
  • set of vertices removed from the graph