EdgeKey (graphs 0.3.0 API)

java.lang.Object
- com.github.moaxcp.graphs.EdgeKey<ID>

Type Parameters:

ID - type of identifiers

Direct Known Subclasses:

DirectedEdgeKey, UndirectedEdgeKey
```
public abstract class EdgeKey<ID>
extends Object
```
Key for identifying edges within a collection such as Map. Extensions of this class define how two edges are equal in terms of the graph. Implementing classes must define equals and hashCode for the type of Edge used in the graph. Classes implementing AbstractGraph should typically use DirectedEdgeKey or UndirectedEdgeKey instead of extending this class.

- Constructor Summary
  
  Constructors
  Constructor Description
  
  EdgeKey(ID from, ID to)
  Creates an EdgeKey with given from and to params.
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  ID getFrom()
  Returns 'from' vertex id.
  
  ID getTo()
  Returns 'to' vertex id.
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

- Constructor Detail
  - EdgeKey
```
public EdgeKey(ID from,
               ID to)
```
    Creates an EdgeKey with given from and to params.
    
    Parameters:
    
    from - vertex id
    
    to - vertex id
- Method Detail
  - getFrom
```
public final ID getFrom()
```
    Returns 'from' vertex id.
    
    Returns:
    
    from id of vertex
  - getTo
```
public final ID getTo()
```
    Returns 'to' vertex id.
    
    Returns:
    
    to id of vertex