A route map of cities connected by undirected routes with a given distance
and travel time.
The same cities may be connected by multiple routes (e.g. Autobahn or Bundesstraße) with different distances
and travel times. The route map is therefore a Multigraph.
AnythingObjectBasic ...and other supertypesAbstractIncidenceList ...and other supertypesno subtypes hierarchy
| Initializer |
RouteMap({City*} cities, {Route*} routes) |
| Attributes | |
distances | Source Codeshared distances distancesAn accessor for the distance of a route. |
travelTimes | Source Codeshared travelTimes travelTimesAn accessor for the travel time of a route. |
| Inherited Attributes |
Attributes inherited from: AbstractIncidenceList<V,E,G>edges, vertices |
Attributes inherited from: Object |
Attributes inherited from: AdjacencyGraph<V>empty, notEmpty |
Attributes inherited from: IncidenceGraph<V,E>edges |
| Methods | |
create | Source Codeshared actual RouteMap create({City*} vertices, {Route*} edges)Create RouteMap from vertices and edges (used by filter methods). Refines AbstractIncidenceList.create (create) |
edgesConnecting | Source Codeshared actual {Route*} edgesConnecting(City source, City target)Answer all routes between the given cities. Refines Multigraph.edgesConnecting (edgesConnecting) |
| Inherited Methods |
Methods inherited from: AbstractIncidenceList<V,E,G>filterEdges, filterVertices |
Methods inherited from: Object |
Methods inherited from: AdjacencyGraph<V>containsEdge, degreeOf, forEachNeighbor, hasNeighbors, neighbors |
Methods inherited from: IncidenceGraph<V,E>adjacentEdges, forEachAdjacentEdge |
Methods inherited from: Multigraph<V,E>edgesConnecting, occurrencesOfEdge |
Methods inherited from: UndirectedGraph<V,E>incomingEdgesOf, outgoingEdgesOf |
| Nested Classes | |
distances | Source Codeshared distancesAn accessor for the distance of a route. |
travelTimes | Source Codeshared travelTimesAn accessor for the travel time of a route. |