OverlayGraph (OpenTripPlanner 1.3.0 API)

Constructors
Constructor and Description
`OverlayGraph()` Create an empty OverlayGraph.
`OverlayGraph(Graph g)` Copy contents of a Graph into this OverlayGraph

All Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`void`	`addEdge(Edge e)`
`void`	`addIncoming(Vertex tov, Edge e)`
`void`	`addOutgoing(Vertex fromv, Edge e)`
`boolean`	`containsVertex(Vertex vertex)`
`int`	`countEdges()` A single edge can appear once or twice.
`int`	`countVertices()` A single Vertex can appear once or twice.
`int`	`getDegreeIn(Vertex v)`
`int`	`getDegreeOut(Vertex v)`
`List<Edge>`	`getIncoming(Vertex v)`
`List<Edge>`	`getOutgoing(Vertex v)`
`Collection<Vertex>`	`getVertices()` A single Vertex can appear once or twice.
`void`	`removeEdge(Edge e)`
`void`	`removeIncoming(Vertex tov, Edge e)`
`void`	`removeOutgoing(Vertex fromv, Edge e)`
`void`	`removeVertex(Vertex vertex)`

public void addOutgoing(Vertex fromv,
                        Edge e)

public void addIncoming(Vertex tov,
                        Edge e)

public void removeOutgoing(Vertex fromv,
                           Edge e)

public void removeIncoming(Vertex tov,
                           Edge e)

public List<Edge> getOutgoing(Vertex v)

public List<Edge> getIncoming(Vertex v)

countEdges
```
public int countEdges()
```
A single edge can appear once or twice. (CH graphs might have only outgoing or only incoming edges.) Avoid double-counting.

getVertices
```
public Collection<Vertex> getVertices()
```
A single Vertex can appear once or twice. (CH graphs might have only outgoing or only incoming edges.) Avoid double-counting.

countVertices
```
public int countVertices()
```
A single Vertex can appear once or twice. (CH graphs might have only outgoing or only incoming edges.) Avoid double-counting. This is very inefficient.

public void removeVertex(Vertex vertex)

public boolean containsVertex(Vertex vertex)

Class OverlayGraph