Uses of Interface
org.goplanit.utils.graph.directed.DirectedVertex

Packages that use DirectedVertex

Package	Description
org.goplanit.algorithms.shortest	Shortest Path algorithms for PlanIt
org.goplanit.assignment.ltm.sltm
org.goplanit.assignment.ltm.sltm.conjugate
org.goplanit.assignment.ltm.sltm.consumer
org.goplanit.assignment.ltm.sltm.loading
org.goplanit.graph.directed
org.goplanit.graph.directed.acyclic
org.goplanit.graph.directed.modifier
org.goplanit.graph.directed.modifier.event
org.goplanit.network.layer
org.goplanit.network.layer.macroscopic	Macroscopic physical network component object classes
org.goplanit.network.layer.modifier
org.goplanit.network.layer.physical	Physical network component object classes
org.goplanit.network.layer.service
org.goplanit.network.virtual	Virtual network component object classes
org.goplanit.utils.graph	Utilities for setting up graphs
org.goplanit.utils.graph.directed
org.goplanit.utils.graph.directed.acyclic
org.goplanit.utils.network.layer
org.goplanit.utils.network.layer.modifier
org.goplanit.utils.network.layer.physical
org.goplanit.utils.network.layer.service
org.goplanit.utils.network.virtual	Virtual physical network oriented utility classes
org.goplanit.utils.zoning	zoning oriented utility classes
org.goplanit.zoning
org.goplanit.zoning.modifier.event.handler

Uses of DirectedVertex in org.goplanit.algorithms.shortest

Fields in org.goplanit.algorithms.shortest declared as DirectedVertex

Modifier and Type	Field	Description
protected DirectedVertex	ShortestPathGeneralised.currentSource	Reference to starting point for search for which we collect shortest paths from/to

Fields in org.goplanit.algorithms.shortest with type parameters of type DirectedVertex

Modifier and Type	Field	Description
protected Function<DirectedVertex,Iterable<? extends EdgeSegment>>	ShortestPathAcyclicMinMaxGeneralised.getEdgeSegmentsInDirection	depending on configuration this function collects edge segments in entry or exit direction of vertex
protected Function<DirectedVertex,Iterable<? extends EdgeSegment>>	ShortestPathGeneralised.getEdgeSegmentsInDirection	depending on configuration this function collects edge segments in entry or exit direction of vertex
protected Function<EdgeSegment,DirectedVertex>	ShortestPathAcyclicMinMaxGeneralised.getVertexAtExtreme	depending on configuration this function collects vertex at desired edge segment extremity
protected Function<EdgeSegment,DirectedVertex>	ShortestPathGeneralised.getVertexAtExtreme	depending on configuration this function collects vertex at desired edge segment extremity
protected Function<EdgeSegment,DirectedVertex>	ShortestResultGeneralised.getVertexAtExtreme	depending on configuration this function collects vertex at desired edge segment extremity
protected static Comparator<Pair<DirectedVertex,Double>>	ShortestPathAStar.pairSecondComparator	Comparator to sort based on the second elements minimum value (ascending order)

Methods in org.goplanit.algorithms.shortest that return DirectedVertex

Modifier and Type	Method	Description
DirectedVertex	MinMaxPathResultImpl.getNextVertexForEdgeSegment(EdgeSegment edgeSegment)
DirectedVertex	ShortestResult.getNextVertexForEdgeSegment(EdgeSegment edgeSegment)	Find the next vertex on the given edge segment extremity based on the underlying search this can be either in upstream or downstream direction
DirectedVertex	ShortestResultGeneralised.getNextVertexForEdgeSegment(EdgeSegment edgeSegment)	Find the next vertex on the given edge segment extremity based on the underlying search this can be either in upstream or downstream direction

Methods in org.goplanit.algorithms.shortest that return types with arguments of type DirectedVertex

Modifier and Type	Method	Description
static Function<DirectedVertex,Iterable<? extends EdgeSegment>>	ShortestPathSearchUtils.getEdgeSegmentsInDirectionLambda(ShortestSearchType shortestPathSearchType)	Based on the search type we collect edge segments (up or downstream) for a given vertex.
static Function<DirectedVertex,Iterable<? extends EdgeSegment>>	ShortestPathSearchUtils.getEdgeSegmentsInDirectionLambda(ShortestSearchType shortestPathSearchType, boolean invertDirection)	Based on the search type we collect edge segments (up or downstream) for a given vertex.
static Function<DirectedVertex,Iterable<? extends EdgeSegment>>	ShortestPathSearchUtils.getEdgeSegmentsInDirectionLambda(RootedLabelledBush bush)	Based on the bush configuration we collect different edge segments from vertex (entry or exit segments) compatible with a (shortest) path search.
static Function<DirectedVertex,Iterable<? extends EdgeSegment>>	ShortestPathSearchUtils.getEdgeSegmentsInDirectionLambda(RootedLabelledBush bush, boolean invertDirection)	Based on the bush configuration we collect different edge segments from vertex (entry or exit segments) compatible with a (shortest) path search.
protected Pair<DirectedVertex,DirectedVertex>	ShortestResultGeneralised.getStartEndVertexForResultTraversal(DirectedVertex origin, DirectedVertex destination)	Determine the start and end vertex to use for constructing the path depending on the search type used in the preceding shortest path search
protected Pair<DirectedVertex,DirectedVertex>	ShortestResultGeneralised.getStartEndVertexForResultTraversal(DirectedVertex origin, DirectedVertex destination)	Determine the start and end vertex to use for constructing the path depending on the search type used in the preceding shortest path search
static Function<EdgeSegment,DirectedVertex>	ShortestPathSearchUtils.getVertexFromEdgeSegmentLambda(ShortestSearchType shortestPathSearchType)	Identical to ShortestPathSearchUtils.getVertexFromEdgeSegmentLambda(ShortestSearchType)
static Function<EdgeSegment,DirectedVertex>	ShortestPathSearchUtils.getVertexFromEdgeSegmentLambda(ShortestSearchType shortestPathSearchType, boolean invertDirection)	Based on the search type we collect different vertex direction from edge segment (up or downstream) during shortest path search.
static Function<EdgeSegment,DirectedVertex>	ShortestPathSearchUtils.getVertexFromEdgeSegmentLambda(RootedLabelledBush bush)	Based on the bush configuration we collect different vertex direction from edge segment (up or downstream) compatible with a (shortest) path search.
static Function<EdgeSegment,DirectedVertex>	ShortestPathSearchUtils.getVertexFromEdgeSegmentLambda(RootedLabelledBush bush, boolean invertDirection)	Based on the bush configuration we collect different vertex direction from edge segment (up or downstream) compatible with a (shortest) path search.

Methods in org.goplanit.algorithms.shortest with parameters of type DirectedVertex

Modifier and Type	Method	Description
ACyclicSubGraph	ShortestBushResult.createDirectedAcyclicSubGraph(IdGroupingToken idToken, DirectedVertex origin, DirectedVertex destination)	Create a bush in the form of a directed acyclic subgraph of its parent network (layer) for a given origin-destination vertex.
ACyclicSubGraph	ShortestBushResultGeneralised.createDirectedAcyclicSubGraph(IdGroupingToken idToken, DirectedVertex origin, DirectedVertex destination)	Create a bush in the form of a directed acyclic subgraph of its parent network (layer) for a given origin-destination vertex.
<T extends SimpleDirectedPath> T	MinMaxPathResultImpl.createPath(DirectedPathFactory<T> pathFactory, DirectedVertex origin, DirectedVertex destination)	Create the path from the provided origin to a specified destination vertex, using the results available.
<T extends SimpleDirectedPath> T	ShortestPathResult.createPath(DirectedPathFactory<T> pathFactory, DirectedVertex origin, DirectedVertex destination)	Create the path from the provided origin to a specified destination vertex, using the results available.
<T extends SimpleDirectedPath> T	ShortestPathResultGeneralised.createPath(DirectedPathFactory<T> pathFactory, DirectedVertex origin, DirectedVertex destination)	Create the path from the provided origin to a specified destination vertex, using the results available.
MinMaxPathResultImpl	ShortestPathAcyclicMinMaxGeneralised.execute(DirectedVertex startVertex)	Perform a generalised min-max path search where we construct both the least and most costly path from the start vertex provided to all other vertices in the (sub)graph based on the configuration.
ShortestPathResult	ShortestPathDijkstra.execute(ShortestSearchType searchType, DirectedVertex startVertex)	Execute shortest path search based on given search direction and start vertex
ShortestBushResult	ShortestBushAllToOne.executeAllToOne(DirectedVertex currentDestination)	Construct shortest bush result from any node to a sink node based on directed LinkSegment edges
ShortestBushResult	ShortestBushGeneralised.executeAllToOne(DirectedVertex currentDestination)	Construct shortest bush result from all nodes to destination node in the network based on directed LinkSegment edges
MinMaxPathResult	ShortestPathAcyclicMinMaxGeneralised.executeAllToOne(DirectedVertex currentDestination)	Construct shortest paths from all nodes to a destination node in the network based on directed LinkSegment edges
ShortestPathResult	ShortestPathAllToOne.executeAllToOne(DirectedVertex currentDestination)	Construct shortest paths from all nodes to a destination node in the network based on directed LinkSegment edges
ShortestPathResult	ShortestPathDijkstra.executeAllToOne(DirectedVertex currentDestination)	Construct shortest paths from all nodes to a single sink node in the network based on directed Link segment edges
ShortestBushResult	ShortestBushGeneralised.executeOneToAll(DirectedVertex currentOrigin)	Construct shortest bush result from origin node to all other nodes in the network based on directed LinkSegment edges
ShortestBushResult	ShortestBushOneToAll.executeOneToAll(DirectedVertex currentOrigin)	Construct shortest bush result from source node to all other nodes in the network based on directed LinkSegment edges
MinMaxPathResult	ShortestPathAcyclicMinMaxGeneralised.executeOneToAll(DirectedVertex currentOrigin)	Construct shortest paths from source node to all other nodes in the network based on directed LinkSegment edges
ShortestPathResult	ShortestPathDijkstra.executeOneToAll(DirectedVertex currentOrigin)	Construct shortest paths from source node to all other nodes in the network based on directed LinkSegment edges
ShortestPathResult	ShortestPathOneToAll.executeOneToAll(DirectedVertex currentOrigin)	Construct shortest paths from source node to all other nodes in the network based on directed LinkSegment edges
ShortestPathResult	ShortestPathAStar.executeOneToOne(DirectedVertex origin, DirectedVertex destination)
ShortestPathResult	ShortestPathAStar.executeOneToOne(DirectedVertex origin, DirectedVertex destination, Set<? extends EdgeSegment> bannedSegments)	Construct shortest paths from source node to all other nodes in the network based on directed LinkSegment edges while imposing custom constraints on certain edge segments not being allowed to be used
ShortestPathResult	ShortestPathOneToOne.executeOneToOne(DirectedVertex origin, DirectedVertex destination)	Construct shortest paths from source node to all other nodes in the network based on directed LinkSegment edges
ShortestPathResult	ShortestPathOneToOne.executeOneToOne(DirectedVertex origin, DirectedVertex destination, Set<? extends EdgeSegment> bannedSegments)	Construct shortest paths from source node to all other nodes in the network based on directed LinkSegment edges while imposing custom constraints on certain edge segments not being allowed to be used
default int	ShortestPathResult.forEachNextEdgeSegment(DirectedVertex startVertex, DirectedVertex endVertex, Consumer<EdgeSegment> nextEdgeSegmentConsumer)	apply consumer to each edge segment on path.
protected Pair<DirectedVertex,DirectedVertex>	ShortestResultGeneralised.getStartEndVertexForResultTraversal(DirectedVertex origin, DirectedVertex destination)	Determine the start and end vertex to use for constructing the path depending on the search type used in the preceding shortest path search

Method parameters in org.goplanit.algorithms.shortest with type arguments of type DirectedVertex

Modifier and Type	Method	Description
protected void	ShortestPathGeneralised.initialiseOpenVertices(PriorityQueue<Pair<DirectedVertex,Double>> openVertices, double[] vertexMeasuredCost)	Initialise the open vertices.

Uses of DirectedVertex in org.goplanit.assignment.ltm.sltm

Classes in org.goplanit.assignment.ltm.sltm with type parameters of type DirectedVertex

Modifier and Type	Class	Description
class	RootedBush<V extends DirectedVertex,ES extends EdgeSegment>	A rooted bush is an acyclic directed graph comprising of implicit paths along a network.

Methods in org.goplanit.assignment.ltm.sltm that return DirectedVertex

Modifier and Type	Method	Description
DirectedVertex	Pas.getDivergeVertex()	Collect the start vertex of the PAS
DirectedVertex	Pas.getMergeVertex()	Collect the end vertex of the PAS

Methods in org.goplanit.assignment.ltm.sltm that return types with arguments of type DirectedVertex

Modifier and Type	Method	Description
Pair<DirectedVertex,Map<DirectedVertex,EdgeSegment>>	RootedLabelledBush.findBushAlternativeSubpath(DirectedVertex referenceVertex, short[] alternativeSubpathVertexLabels)	The alternative subpath is provided through link segment labels of value -1.
Pair<DirectedVertex,Map<DirectedVertex,EdgeSegment>>	RootedLabelledBush.findBushAlternativeSubpath(DirectedVertex referenceVertex, short[] alternativeSubpathVertexLabels)	The alternative subpath is provided through link segment labels of value -1.
Iterator<? extends DirectedVertex>	Bush.getTopologicalIterator(boolean originDestinationDirection)	Collect an iterator over topologically sorted bush in origin-destination or destination-origin direction.
Iterator<DirectedVertex>	DestinationBush.getTopologicalIterator(boolean originDestinationDirection)	Collect an iterator over topologically sorted bush in origin-destination or destination-origin direction.
Iterator<DirectedVertex>	OriginBush.getTopologicalIterator(boolean originDestinationDirection)	Collect an iterator over topologically sorted bush in origin-destination or destination-origin direction.

Methods in org.goplanit.assignment.ltm.sltm with parameters of type DirectedVertex

Modifier and Type	Method	Description
double	RootedLabelledBush.computeSubPathAcceptedFlow(DirectedVertex startVertex, DirectedVertex endVertex, EdgeSegment[] subPathArray, double[] linkSegmentAcceptanceFactors)	Determine the accepted flow between origin,destination vertex using the subpath given by the subPathArray in order from start to finish.
double	RootedLabelledBush.computeSubPathSendingFlow(DirectedVertex startVertex, DirectedVertex endVertex, Map<DirectedVertex,EdgeSegment> subPathMap)	Determine the sending flow between origin,destination vertex using the subpath given by the subPathMap, where each vertex provides its exit segment.
static EdgeSegment[]	PasManager.createSubpathArrayFrom(DirectedVertex closestToSearchRoot, DirectedVertex furthestFromSearchRoot, ShortestPathResult searchResultTree, int arrayLength, boolean truncateArray)	Extract a subpath in the form of a raw edge segment array in downstream direction based on the shortest path result provided.
static EdgeSegment[]	PasManager.createSubpathArrayFrom(DirectedVertex closestToSearchRoot, DirectedVertex furthestFromSearchRoot, ShortestSearchType shortestSearchType, Map<DirectedVertex,EdgeSegment> invertedBfSearchResultTree, int arrayLength, boolean truncateArray)	Extract a subpath in the form of a raw edge segment array in downstream direction based on the breadth-first (BF) search result provided.
void	BushInitialiserHelper.executeOdBushInitialisation(DirectedVertex originVertex, Double oDDemandPcuH, Iterator<DirectedVertex> vertexIter, BushFlowLabel entryExitLabel)	Execute the initialisation by ensuring the correct flow is added to the bush for the given od dag and it related demand.
Pair<DirectedVertex,Map<DirectedVertex,EdgeSegment>>	RootedLabelledBush.findBushAlternativeSubpath(DirectedVertex referenceVertex, short[] alternativeSubpathVertexLabels)	The alternative subpath is provided through link segment labels of value -1.
Pas	PasManager.findFirstSuitableExistingPas(RootedLabelledBush bush, DirectedVertex referenceVertex, double[] flowAcceptanceFactors, double reducedCost)	find the first PAS which has the given merge vertex as end vertex and which if we would extend the bush with its least cost alternative would improve to the point it is considered effective enough compared to the upper bound (reduced cost) improvement provided as well as that the bush has sufficient flow on the high cost alternative of the PAS such that it can improve sufficiently by shifting flow towards the new low cost segment.
Collection<Pas>	PasManager.getPassByReferenceVertex(DirectedVertex referenceVertex)	Collect all PASs that share the same reference vertex.
boolean	PasManager.isRegisteredOnAnyPasAtReferenceVertex(RootedLabelledBush bush, DirectedVertex referenceVertex)	Verify if any PAS at given reference vertex is used by this origin bush.

Method parameters in org.goplanit.assignment.ltm.sltm with type arguments of type DirectedVertex

Modifier and Type	Method	Description
double	RootedLabelledBush.computeSubPathSendingFlow(DirectedVertex startVertex, DirectedVertex endVertex, Map<DirectedVertex,EdgeSegment> subPathMap)	Determine the sending flow between origin,destination vertex using the subpath given by the subPathMap, where each vertex provides its exit segment.
static EdgeSegment[]	PasManager.createSubpathArrayFrom(DirectedVertex closestToSearchRoot, DirectedVertex furthestFromSearchRoot, ShortestSearchType shortestSearchType, Map<DirectedVertex,EdgeSegment> invertedBfSearchResultTree, int arrayLength, boolean truncateArray)	Extract a subpath in the form of a raw edge segment array in downstream direction based on the breadth-first (BF) search result provided.
void	BushInitialiserHelper.executeOdBushInitialisation(DirectedVertex originVertex, Double oDDemandPcuH, Iterator<DirectedVertex> vertexIter, BushFlowLabel entryExitLabel)	Execute the initialisation by ensuring the correct flow is added to the bush for the given od dag and it related demand.
void	Pas.forEachVertex(boolean lowCostSegment, Consumer<DirectedVertex> vertexConsumer)	Apply consumer to each vertex on one of the cost segments

Constructors in org.goplanit.assignment.ltm.sltm with parameters of type DirectedVertex

Constructor	Description
RootedBush(IdGroupingToken idToken, DirectedVertex rootVertex, boolean inverted, UntypedACyclicSubGraph<V,ES> dag)	Constructor
RootedLabelledBush(IdGroupingToken idToken, DirectedVertex rootVertex, boolean inverted, long maxSubGraphEdgeSegments)	Constructor

Uses of DirectedVertex in org.goplanit.assignment.ltm.sltm.conjugate

Methods in org.goplanit.assignment.ltm.sltm.conjugate that return types with arguments of type DirectedVertex

Modifier and Type	Method	Description
Pair<DirectedVertex,Map<DirectedVertex,EdgeSegment>>	ConjugateDestinationBush.findBushAlternativeSubpath(DirectedVertex referenceVertex, short[] alternativeSubpathVertexLabels)	The alternative subpath is provided through link segment labels of value -1.
Pair<DirectedVertex,Map<DirectedVertex,EdgeSegment>>	ConjugateDestinationBush.findBushAlternativeSubpath(DirectedVertex referenceVertex, short[] alternativeSubpathVertexLabels)	The alternative subpath is provided through link segment labels of value -1.

Methods in org.goplanit.assignment.ltm.sltm.conjugate with parameters of type DirectedVertex

Modifier and Type	Method	Description
double	ConjugateDestinationBush.computeSubPathAcceptedFlow(DirectedVertex startVertex, DirectedVertex endVertex, EdgeSegment[] subPathArray, double[] linkSegmentAcceptanceFactors)	Determine the accepted flow between origin,destination vertex using the subpath given by the subPathArray in order from start to finish.
double	ConjugateDestinationBush.computeSubPathSendingFlow(DirectedVertex startVertex, DirectedVertex endVertex, Map<DirectedVertex,EdgeSegment> subPathMap)	Determine the sending flow between origin,destination vertex using the subpath given by the subPathMap, where each vertex provides its exit segment.
Pair<DirectedVertex,Map<DirectedVertex,EdgeSegment>>	ConjugateDestinationBush.findBushAlternativeSubpath(DirectedVertex referenceVertex, short[] alternativeSubpathVertexLabels)	The alternative subpath is provided through link segment labels of value -1.

Method parameters in org.goplanit.assignment.ltm.sltm.conjugate with type arguments of type DirectedVertex

Modifier and Type	Method	Description
double	ConjugateDestinationBush.computeSubPathSendingFlow(DirectedVertex startVertex, DirectedVertex endVertex, Map<DirectedVertex,EdgeSegment> subPathMap)	Determine the sending flow between origin,destination vertex using the subpath given by the subPathMap, where each vertex provides its exit segment.

Uses of DirectedVertex in org.goplanit.assignment.ltm.sltm.consumer

Methods in org.goplanit.assignment.ltm.sltm.consumer with parameters of type DirectedVertex

Modifier and Type	Method	Description
void	ApplyToNodeModelResult.acceptNonBlockingLinkBasedResult(DirectedVertex node, double[] linkSegmentSendingFlow)	A centroid node is a special node where all flow is always accepted (destination incoming links), or sending flows do not come from turns but from origin zone (origin exit links).
void	NMRCollectMostRestrictingTurnConsumer.acceptNonBlockingLinkBasedResult(DirectedVertex node, double[] sendingFlows)	A centroid node is a special node where all flow is always accepted (destination incoming links), or sending flows do not come from turns but from origin zone (origin exit links).
void	NMRUpdateEntryLinksOutflowConsumer.acceptNonBlockingLinkBasedResult(DirectedVertex node, double[] linkSegmentSendingFlows)	A centroid node is a special node where all flow is always accepted (destination incoming links), or sending flows do not come from turns but from origin zone (origin exit links).
void	NMRUpdateExitLinkInflowsConsumer.acceptNonBlockingLinkBasedResult(DirectedVertex node, double[] sendingFlows)	A centroid node is a special node where all flow is always accepted (destination incoming links), or sending flows do not come from turns but from origin zone (origin exit links).
void	ApplyToNodeModelResult.acceptTurnBasedResult(DirectedVertex node, org.ojalgo.array.Array1D<Double> flowAcceptanceFactors, NodeModel nodeModel)	Result of a node model update
void	NMRCollectMostRestrictingTurnConsumer.acceptTurnBasedResult(DirectedVertex node, org.ojalgo.array.Array1D<Double> flowAcceptanceFactors, NodeModel nodeModel)	Result of a node model update
void	NMRUpdateEntryLinksOutflowConsumer.acceptTurnBasedResult(DirectedVertex node, org.ojalgo.array.Array1D<Double> flowAcceptanceFactor, NodeModel nodeModel)	Result of a node model update
void	NMRUpdateExitLinkInflowsConsumer.acceptTurnBasedResult(DirectedVertex node, org.ojalgo.array.Array1D<Double> flowAcceptanceFactors, NodeModel nodeModel)	Result of a node model update

Uses of DirectedVertex in org.goplanit.assignment.ltm.sltm.loading

Methods in org.goplanit.assignment.ltm.sltm.loading that return types with arguments of type DirectedVertex

Modifier and Type	Method	Description
TreeSet<DirectedVertex>	SplittingRateData.getTrackedNodes()	Collect all registered potentially blocking nodes
TreeSet<DirectedVertex>	SplittingRateDataComplete.getTrackedNodes()	Collect all registered potentially blocking nodes
TreeSet<DirectedVertex>	SplittingRateDataPartial.getTrackedNodes()	Collect all registered potentially blocking nodes

Methods in org.goplanit.assignment.ltm.sltm.loading with parameters of type DirectedVertex

Modifier and Type	Method	Description
void	SplittingRateDataComplete.activateNode(DirectedVertex trackedNode)	Activate a node so we are able to track its splitting rates (and turn flows) during loading.
boolean	SplittingRateData.isPotentiallyBlocking(DirectedVertex nodeToVerify)	Verify if node is registered as potentially blocking
boolean	SplittingRateDataComplete.isPotentiallyBlocking(DirectedVertex nodeToVerify)	Verify if node is registered as potentially blocking
boolean	SplittingRateDataPartial.isPotentiallyBlocking(DirectedVertex nodeToVerify)	Verify if node is registered as potentially blocking
boolean	SplittingRateData.isTracked(DirectedVertex nodeToVerify)	Verify if node is registered as being tracked with splitting rates
boolean	SplittingRateDataComplete.isTracked(DirectedVertex nodeToVerify)	Verify if node is registered as being tracked with splitting rates
boolean	SplittingRateDataPartial.isTracked(DirectedVertex nodeToVerify)	Verify if node is registered as being tracked with splitting rates
static void	StaticLtmNetworkLoading.performNodeModelUpdate(DirectedVertex node, ApplyToNodeModelResult consumer, StaticLtmNetworkLoading staticLtmNetworkLoading)	conduct a node model update sLTM style with
void	SplittingRateDataPartial.registerPotentiallyBlockingNode(DirectedVertex potentiallyBlockingNode)	Register a potentially blocking node so we not only track its splitting rates but also mark it as potentially blocking.
void	SplittingRateDataPartial.registerTrackedNode(DirectedVertex trackNode)	Register a node so we are able to track its splitting rates (and turn flows) during loading

Uses of DirectedVertex in org.goplanit.graph.directed

Classes in org.goplanit.graph.directed with type parameters of type DirectedVertex

Modifier and Type	Class	Description
class	DirectedEdgeImpl<V extends DirectedVertex,ES extends EdgeSegment>	Edge class connecting two vertices via some geometry.
class	DirectedGraphImpl<V extends DirectedVertex,E extends DirectedEdge,ES extends EdgeSegment>	A directed graph implementation consisting of directed vertices, directed edges and edge segments
class	UntypedDirectedGraphImpl<V extends DirectedVertex,E extends DirectedEdge,ES extends EdgeSegment>	A directed graph implementation consisting of directed vertices and directed edges

Classes in org.goplanit.graph.directed that implement DirectedVertex

Modifier and Type	Class	Description
class	ConjugateDirectedVertexImpl	Conjugate directed vertex representation connected to one or more entry and exit conjugate edges
class	DirectedVertexImpl<E extends EdgeSegment>	vertex representation connected to one or more entry and exit edges

Methods in org.goplanit.graph.directed that return DirectedVertex

Modifier and Type	Method	Description
DirectedVertex	DirectedVertexFactoryImpl.createNew()	Create a new directed vertex (without registering on this class)
DirectedVertex	DirectedVertexFactoryImpl.registerNew()	Create and register new directed vertex

Methods in org.goplanit.graph.directed with parameters of type DirectedVertex

Modifier and Type	Method	Description
DirectedEdge	DirectedEdgeFactoryImpl.registerNew(DirectedVertex vertexA, DirectedVertex vertexB, boolean registerOnVertices)	Create new edge to network identified via its id, allow to be registered on vertices if indicated)

Method parameters in org.goplanit.graph.directed with type arguments of type DirectedVertex

Modifier and Type	Method	Description
DirectedVerticesImpl	DirectedVerticesImpl.deepCloneWithMapping(BiConsumer<DirectedVertex,DirectedVertex> mapper)	Deep clone implementation with mapping retained between original and copies created
DirectedVerticesImpl	DirectedVerticesImpl.deepCloneWithMapping(BiConsumer<DirectedVertex,DirectedVertex> mapper)	Deep clone implementation with mapping retained between original and copies created

Constructor parameters in org.goplanit.graph.directed with type arguments of type DirectedVertex

Constructor	Description
DirectedVerticesImpl(DirectedVerticesImpl other, boolean deepCopy, BiConsumer<DirectedVertex,DirectedVertex> biConsumer)	Copy constructor, also creates a new factory with reference to this container
DirectedVerticesImpl(DirectedVerticesImpl other, boolean deepCopy, BiConsumer<DirectedVertex,DirectedVertex> biConsumer)	Copy constructor, also creates a new factory with reference to this container

Uses of DirectedVertex in org.goplanit.graph.directed.acyclic

Classes in org.goplanit.graph.directed.acyclic with type parameters of type DirectedVertex

Modifier and Type	Class	Description
class	UntypedACyclicSubGraphImpl<V extends DirectedVertex,E extends EdgeSegment>	An acyclic sub graph contains a subset of the full graph without cycles.

Methods in org.goplanit.graph.directed.acyclic with parameters of type DirectedVertex

Modifier and Type	Method	Description
protected org.goplanit.graph.directed.acyclic.AcyclicVertexData	UntypedACyclicSubGraphImpl.getVertexData(DirectedVertex vertex)	Collect vertex data for given vertex

Constructors in org.goplanit.graph.directed.acyclic with parameters of type DirectedVertex

Constructor	Description
ACyclicSubGraphImpl(IdGroupingToken groupId, DirectedVertex rootVertex, boolean invertedDirection, int numberOfParentEdgeSegments)	Constructor

Uses of DirectedVertex in org.goplanit.graph.directed.modifier

Methods in org.goplanit.graph.directed.modifier with parameters of type DirectedVertex

Modifier and Type	Method	Description
<Ex extends DirectedEdge> Ex	DirectedGraphModifierImpl.breakEdgeAt(DirectedVertex vertexToBreakAt, Ex edgeToBreak, PlanitJtsCrsUtils geoUtils)	Identical to the GraphImpl implementation except that we now also account for the edge segments present on the edge.
<Ex extends DirectedEdge> Map<Long,Pair<Ex,Ex>>	DirectedGraphModifierImpl.breakEdgesAt(List<Ex> edgesToBreak, DirectedVertex vertexToBreakAt, org.opengis.referencing.crs.CoordinateReferenceSystem crs)	Break the passed in edges by inserting the passed in vertex in between.
void	DirectedGraphModifierImpl.removeSubGraphOf(DirectedVertex referenceVertex)	remove the (sub)graph in which the passed in vertex resides.
void	DirectedGraphModifierImpl.removeVertex(DirectedVertex vertex)	Remove a vertex by removing it from the graph and the edges it is connected to.

Method parameters in org.goplanit.graph.directed.modifier with type arguments of type DirectedVertex

Modifier and Type	Method	Description
void	DirectedGraphModifierImpl.removeSubGraph(Set<? extends DirectedVertex> subGraphToRemove)	remove the subgraph identified by the passed in vertices

Uses of DirectedVertex in org.goplanit.graph.directed.modifier.event

Methods in org.goplanit.graph.directed.modifier.event that return DirectedVertex

Modifier and Type	Method	Description
DirectedVertex	BreakEdgeSegmentEvent.getVertexToBreakAt()	collect vertex to break at

Constructors in org.goplanit.graph.directed.modifier.event with parameters of type DirectedVertex

Constructor	Description
BreakEdgeSegmentEvent(DirectedGraphModifier source, DirectedVertex vertexToBreakAt, EdgeSegment brokenEdgeSegment)	constructor

Uses of DirectedVertex in org.goplanit.network.layer

Classes in org.goplanit.network.layer with type parameters of type DirectedVertex

Modifier and Type	Class	Description
class	UntypedNetworkLayerImpl<V extends DirectedVertex,E extends DirectedEdge,S extends EdgeSegment>	Model free network layer consisting of containers for vertices, edges, and edge segments each of which can be typed separately.

Uses of DirectedVertex in org.goplanit.network.layer.macroscopic

Classes in org.goplanit.network.layer.macroscopic with type parameters of type DirectedVertex

Modifier and Type	Class	Description
class	MacroscopicLinkImpl<N extends DirectedVertex,LS extends MacroscopicLinkSegment>	Link class connecting two nodes via some geometry.

Uses of DirectedVertex in org.goplanit.network.layer.modifier

Classes in org.goplanit.network.layer.modifier with type parameters of type DirectedVertex

Modifier and Type	Class	Description
class	UntypedNetworkLayerModifierImpl<V extends DirectedVertex,E extends DirectedEdge,S extends EdgeSegment>	Modifier class for model free network layer, generics used to allow derived classes to provide typed versions for containers and content of containers.

Uses of DirectedVertex in org.goplanit.network.layer.physical

Classes in org.goplanit.network.layer.physical with type parameters of type DirectedVertex

Modifier and Type	Class	Description
class	LinkImpl<N extends DirectedVertex,LS extends EdgeSegment>	Link class connecting two nodes via some geometry.

Classes in org.goplanit.network.layer.physical that implement DirectedVertex

Modifier and Type	Class	Description
class	ConjugateNodeImpl	Conjugate node representation connected to one or more conjugate (entry and exit) conjugate links.
class	NodeImpl<LS extends EdgeSegment>	Node representation connected to one or more entry and exit links

Uses of DirectedVertex in org.goplanit.network.layer.service

Classes in org.goplanit.network.layer.service that implement DirectedVertex

Modifier and Type	Class	Description
class	ServiceNodeImpl	A ServiceNode is used in a ServiceNetwork where it holds a reference to a DirectedNode of the ServiceNetworkLayer's underlying physical network layer.

Uses of DirectedVertex in org.goplanit.network.virtual

Classes in org.goplanit.network.virtual that implement DirectedVertex

Modifier and Type	Class	Description
class	CentroidVertexImpl	The vertex with a direct relation to a centroid (for a given layer)
class	ConjugateConnectoidNodeImpl	Conjugate node representation connected to one or more conjugate (entry and exit) conjugate links.

Methods in org.goplanit.network.virtual with parameters of type DirectedVertex

Modifier and Type	Method	Description
ConnectoidEdge	ConnectoidEdgeFactoryImpl.registerNew(CentroidVertex centroidVertex, DirectedVertex nonCentroidVertex, double lengthKm)	Create new connectoid edges from a specified connectoid to all centroids of the zones this connectoid has registered as access zone.

Constructors in org.goplanit.network.virtual with parameters of type DirectedVertex

Constructor	Description
ConnectoidEdgeImpl(IdGroupingToken groupId, CentroidVertex centroidA, DirectedVertex vertexB, double length)	Constructor

Uses of DirectedVertex in org.goplanit.utils.graph

Classes in org.goplanit.utils.graph with type parameters of type DirectedVertex

Modifier and Type	Interface	Description
interface	UntypedDirectedGraph<V extends DirectedVertex,E extends DirectedEdge,ES extends EdgeSegment>	Interface for a directed graph

Uses of DirectedVertex in org.goplanit.utils.graph.directed

Classes in org.goplanit.utils.graph.directed with type parameters of type DirectedVertex

Modifier and Type	Interface	Description
interface	DirectedGraph<V extends DirectedVertex,E extends DirectedEdge,ES extends EdgeSegment>	Interface for a directed graph with explicit container types rather than the base containers.
interface	DirectedSubGraph<V extends DirectedVertex,E extends EdgeSegment>	A directed subgraph interface for a given parent graph by registering edge segments on it (and therefore vertices and edges)

Subinterfaces of DirectedVertex in org.goplanit.utils.graph.directed

Modifier and Type	Interface	Description
interface	ConjugateDirectedVertex	Conjugate of directed vertex representing an edge segment in "regular" directed graph

Fields in org.goplanit.utils.graph.directed with type parameters of type DirectedVertex

Modifier and Type	Field	Description
static Function<EdgeSegment,DirectedVertex>	EdgeSegment.getDownstreamVertex	Function collecting downstream vertex for edge segment
static Function<DirectedVertex,Iterable<? extends EdgeSegment>>	DirectedVertex.getEntryEdgeSegments	Function collecting entry edge segments for vertex
static Function<DirectedVertex,Iterable<? extends EdgeSegment>>	DirectedVertex.getExitEdgeSegments	Function collecting exit edge segments for vertex
static Function<EdgeSegment,DirectedVertex>	EdgeSegment.getUpstreamVertex	Function collecting upstream vertex for edge segment

Methods in org.goplanit.utils.graph.directed that return DirectedVertex

Modifier and Type	Method	Description
DirectedVertex	DirectedVertexFactory.createNew()	Create a new directed vertex (without registering on this class)
default DirectedVertex	EdgeSegment.getDownstreamVertex()	Get the segment's downstream vertex
default DirectedVertex	EdgeSegment.getUpstreamVertex()	Get the segment's upstream vertex
DirectedVertex	DirectedEdge.getVertexA()	Vertex A of the edge
DirectedVertex	DirectedEdge.getVertexB()	Vertex B of the edge
DirectedVertex	DirectedVertexFactory.registerNew()	Create and register new directed vertex

Methods in org.goplanit.utils.graph.directed that return types with arguments of type DirectedVertex

Modifier and Type	Method	Description
static Function<DirectedVertex,Iterable<? extends EdgeSegment>>	DirectedVertex.getEdgeSegmentsForVertexLambda(boolean entrySegments)	Collect lambda function that collects either up or downstream edge segments
static Function<EdgeSegment,DirectedVertex>	EdgeSegment.getVertexForEdgeSegmentLambda(boolean upstreamVertex)	Collect vertex of given edge segment lambda

Methods in org.goplanit.utils.graph.directed with parameters of type DirectedVertex

Modifier and Type	Method	Description
default ConjugateEdgeSegment	ConjugateDirectedVertex.getEdgeSegment(DirectedVertex otherVertex)	collect the first edge segment corresponding to the provided other vertex
default EdgeSegment	DirectedVertex.getEdgeSegment(DirectedVertex otherVertex)	collect the first edge segment corresponding to the provided other vertex
default DirectedEdge	DirectedEdgeFactory.registerNew(DirectedVertex vertexA, DirectedVertex vertexB)	Create and register new directed edge to graph identified via its id, (not registered on vertices)
DirectedEdge	DirectedEdgeFactory.registerNew(DirectedVertex vertexA, DirectedVertex vertexB, boolean registerOnVertices)	Create new edge to network identified via its id, allow to be registered on vertices if indicated)

Uses of DirectedVertex in org.goplanit.utils.graph.directed.acyclic

Classes in org.goplanit.utils.graph.directed.acyclic with type parameters of type DirectedVertex

Modifier and Type	Interface	Description
interface	UntypedACyclicSubGraph<V extends DirectedVertex,E extends EdgeSegment>	An untyped acyclic sub graph contains a subset of a full graph, with generics regarding vertices and edges, without cycles.

Uses of DirectedVertex in org.goplanit.utils.network.layer

Classes in org.goplanit.utils.network.layer with type parameters of type DirectedVertex

Modifier and Type	Interface	Description
interface	UntypedDirectedGraphLayer<V extends DirectedVertex,E extends DirectedEdge,S extends EdgeSegment>	Network layer comprising containers with custom entity types.

Uses of DirectedVertex in org.goplanit.utils.network.layer.modifier

Classes in org.goplanit.utils.network.layer.modifier with type parameters of type DirectedVertex

Modifier and Type	Interface	Description
interface	UntypedDirectedGraphLayerModifier<V extends DirectedVertex,E extends DirectedEdge,S extends EdgeSegment>	Modifier with additional functionality related to modifications to layers derived from UntypedDirectedGraphLayer.

Uses of DirectedVertex in org.goplanit.utils.network.layer.physical

Subinterfaces of DirectedVertex in org.goplanit.utils.network.layer.physical

Modifier and Type	Interface	Description
interface	ConjugateNode	Conjugate Node is the conjugate of a normal link.
interface	Node	Node is a vertex but not all vertices are nodes.

Uses of DirectedVertex in org.goplanit.utils.network.layer.service

Subinterfaces of DirectedVertex in org.goplanit.utils.network.layer.service

Modifier and Type	Interface	Description
interface	ServiceNode	Service node is a vertex but not all vertices are service nodes.

Uses of DirectedVertex in org.goplanit.utils.network.virtual

Subinterfaces of DirectedVertex in org.goplanit.utils.network.virtual

Modifier and Type	Interface	Description
interface	CentroidVertex	Centroid vertex represents manifestation of a centroid on a particular layer, where it materisalises as a vertex in the virtual network
interface	ConjugateConnectoidNode	Conjugate Node is the conjugate of a normal link.

Methods in org.goplanit.utils.network.virtual with parameters of type DirectedVertex

Modifier and Type	Method	Description
ConnectoidEdge	ConnectoidEdgeFactory.registerNew(CentroidVertex centroidVertex, DirectedVertex nonCentroidVertex, double lengthKm)	Create new connectoid edges from a specified connectoid to all centroids of the zones this connectoid has registered as access zone.

Uses of DirectedVertex in org.goplanit.utils.zoning

Methods in org.goplanit.utils.zoning that return DirectedVertex

Modifier and Type	Method	Description
DirectedVertex	Connectoid.getAccessVertex()	collect the access vertex for this connectoid

Uses of DirectedVertex in org.goplanit.zoning

Fields in org.goplanit.zoning declared as DirectedVertex

Modifier and Type	Field	Description
protected DirectedVertex	UndirectedConnectoidImpl.accessVertex	the access point to an infrastructure layer

Methods in org.goplanit.zoning that return DirectedVertex

Modifier and Type	Method	Description
DirectedVertex	DirectedConnectoidImpl.getAccessVertex()	collect the access vertex for this connectoid
DirectedVertex	UndirectedConnectoidImpl.getAccessVertex()	collect the access vertex for this connectoid

Methods in org.goplanit.zoning with parameters of type DirectedVertex

Modifier and Type	Method	Description
protected void	UndirectedConnectoidImpl.setAccessVertex(DirectedVertex accessVertex)	Set the accessVertex

Constructors in org.goplanit.zoning with parameters of type DirectedVertex

Constructor	Description
UndirectedConnectoidImpl(IdGroupingToken idToken, DirectedVertex accessVertex)	Constructor
UndirectedConnectoidImpl(IdGroupingToken idToken, DirectedVertex accessVertex, Zone accessZone)	Constructor
UndirectedConnectoidImpl(IdGroupingToken idToken, DirectedVertex accessVertex, Zone accessZone, double length)	Constructor

Uses of DirectedVertex in org.goplanit.zoning.modifier.event.handler

Fields in org.goplanit.zoning.modifier.event.handler with type parameters of type DirectedVertex

Modifier and Type	Field	Description
protected Map<DirectedVertex,ArrayList<Connectoid>>	UpdateConnectoidsOnVertexRemovalHandler.connectoidsByAccessVertex	index all connectoids by access vertex to minimise lookups

Methods in org.goplanit.zoning.modifier.event.handler with parameters of type DirectedVertex

Modifier and Type	Method	Description
protected void	UpdateDirectedConnectoidsOnBreakLinkSegmentHandler.updateConnectedAccessLinkSegment(DirectedVertex vertex, LinkSegment brokenEdgeSegment)	perform the actual update of the connectoids based on the broken edge segment