HashGraph (Asakusa Framework 0.10.4 API)

java.lang.Object
- com.asakusafw.utils.graph.HashGraph<V>

Type Parameters:

V - the vertex value type

All Implemented Interfaces:

Graph<V>, Iterable<Graph.Vertex<V>>
```
public class HashGraph<V>
extends Object
implements Graph<V>
```
An implementation of Graph which uses HashMap in the internal storage.

Nested Class Summary
- Nested classes/interfaces inherited from interface com.asakusafw.utils.graph.Graph
  Graph.Vertex<V>

Constructor Summary

Constructors
Constructor and Description

HashGraph()

Constructors
Constructor and Description
`HashGraph()`

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`void`	`addEdge(V from, V to)` Adds a directed edge from the `source` to `destination`.
`void`	`addEdges(V from, Collection<? extends V> to)` Adds directed edges from the `source` to each vertex in `destinations`.
`void`	`addNode(V node)` Adds a vertex.
`void`	`clear()` Removes the all vertices and edges in this graph.
`boolean`	`contains(Object node)` Returns whether this graph contains the target vertex or not.
`boolean`	`equals(Object obj)`
`Set<V>`	`getConnected(Object key)` Returns the vertices which are direct successors of the specified vertex.
`Set<V>`	`getNodeSet()` Returns the all vertices in this graph.
`int`	`hashCode()`
`boolean`	`isConnected(Object from, Object to)` Returns whether this graph contains the edge from `source` to `destination` or not.
`boolean`	`isEmpty()` Returns whether this graph is empty or not.
`Iterator<Graph.Vertex<V>>`	`iterator()`
`void`	`removeEdge(Object from, Object to)` Removes the edge from `source` to `destination` in this graph.
`void`	`removeNode(Object node)` Removes the vertex in this graph.
`void`	`removeNodes(Collection<?> nodes)` Removes the vertices in this graph.
`String`	`toString()`

Methods inherited from class java.lang.Object
clone, finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.lang.Iterable
forEach, spliterator

- Constructor Detail
  - HashGraph
```
public HashGraph()
```
- Method Detail
  - addEdge
```
public void addEdge(V from,
                    V to)
```
    Description copied from interface: Graph
    
    Adds a directed edge from the source to destination. This method ignores the edge if it is already in this graph. This method also Graph.addNode(Object) source and destination vertices to this graph if they are not in this graph.
    
    Specified by:
    
    addEdge in interface Graph<V>
    
    Parameters:
    
    from - the source vertex value (predecessor)
    
    to - the destination vertex value (successor)
  - addEdges
```
public void addEdges(V from,
                     Collection<? extends V> to)
```
    Description copied from interface: Graph
    
    Adds directed edges from the source to each vertex in destinations. This method ignores an edge if it is already in this graph. This method also Graph.addNode(Object) source and each vertex in destinations to this graph if they are not in this graph. If destinations is an empty collection, this method will only add the source vertex to this graph, and not add any edges.
    
    Specified by:
    
    addEdges in interface Graph<V>
    
    Parameters:
    
    from - the tail vertex value (predecessor)
    
    to - the head vertex values (successors)
  - addNode
```
public void addNode(V node)
```
    Description copied from interface: Graph
    
    Adds a vertex. This method ignores the vertex if it is already in this graph.
    
    Specified by:
    
    addNode in interface Graph<V>
    
    Parameters:
    
    node - the vertex value
  - clear
```
public void clear()
```
    Description copied from interface: Graph
    
    Removes the all vertices and edges in this graph.
    
    Specified by:
    
    clear in interface Graph<V>
  - contains
```
public boolean contains(Object node)
```
    Description copied from interface: Graph
    
    Returns whether this graph contains the target vertex or not.
    
    Specified by:
    
    contains in interface Graph<V>
    
    Parameters:
    
    node - the target vertex value
    
    Returns:
    
    true if this graph contains the target vertex, otherwise false
  - equals
```
public boolean equals(Object obj)
```
    Overrides:
    
    equals in class Object
  - getConnected
```
public Set<V> getConnected(Object key)
```
    Description copied from interface: Graph
    
    Returns the vertices which are direct successors of the specified vertex. If the vertex is not in this graph, this method will return an empty set. Clients should not modify the resulting set.
    
    Specified by:
    
    getConnected in interface Graph<V>
    
    Parameters:
    
    key - the target vertex value
    
    Returns:
    
    the successors of the specified vertex
  - getNodeSet
```
public Set<V> getNodeSet()
```
    Description copied from interface: Graph
    
    Returns the all vertices in this graph. Clients should not modify the resulting set.
    
    Specified by:
    
    getNodeSet in interface Graph<V>
    
    Returns:
    
    the all vertices in this graph
  - hashCode
```
public int hashCode()
```
    Overrides:
    
    hashCode in class Object
  - isConnected
```
public boolean isConnected(Object from,
                           Object to)
```
    Description copied from interface: Graph
    
    Returns whether this graph contains the edge from source to destination or not.
    
    Specified by:
    
    isConnected in interface Graph<V>
    
    Parameters:
    
    from - the source vertex value (predecessor)
    
    to - the destination vertex value (successor)
    
    Returns:
    
    true if this graph contains the edge from source to destination, otherwise false
  - isEmpty
```
public boolean isEmpty()
```
    Description copied from interface: Graph
    
    Returns whether this graph is empty or not.
    
    Specified by:
    
    isEmpty in interface Graph<V>
    
    Returns:
    
    true if this graph does not contains any vertices, otherwise false
  - iterator
```
public Iterator<Graph.Vertex<V>> iterator()
```
    Specified by:
    
    iterator in interface Iterable<Graph.Vertex<V>>
  - removeEdge
```
public void removeEdge(Object from,
                       Object to)
```
    Description copied from interface: Graph
    
    Removes the edge from source to destination in this graph. If this graph does not contain such the edge, this method will do nothing.
    
    Specified by:
    
    removeEdge in interface Graph<V>
    
    Parameters:
    
    from - the source vertex value (predecessor)
    
    to - the destination vertex value (successor)
  - removeNode
```
public void removeNode(Object node)
```
    Description copied from interface: Graph
    
    Removes the vertex in this graph. This method also removes edges which are connected to the target vertex. If this graph does not contain such the vertex, this method will do nothing.
    
    Specified by:
    
    removeNode in interface Graph<V>
    
    Parameters:
    
    node - the target vertex value
  - removeNodes
```
public void removeNodes(Collection<?> nodes)
```
    Description copied from interface: Graph
    
    Removes the vertices in this graph. If this method also removes edges which are connected to vertex in the specified collection. This method ignores vertices which are not in this graph.
    
    Specified by:
    
    removeNodes in interface Graph<V>
    
    Parameters:
    
    nodes - the target vertices
  - toString
```
public String toString()
```
    Overrides:
    
    toString in class Object

Class HashGraph<V>

Nested Class Summary

Nested classes/interfaces inherited from interface com.asakusafw.utils.graph.Graph

Constructor Summary

Method Summary

Methods inherited from class java.lang.Object

Methods inherited from interface java.lang.Iterable

Constructor Detail

HashGraph

Method Detail

addEdge

addEdges

addNode

clear

contains

equals

getConnected

getNodeSet

hashCode

isConnected

isEmpty

iterator

removeEdge

removeNode

removeNodes

toString