alchemist-euclidean-geometry/it.unibo.alchemist.model.implementations.geometry.euclidean2d.graph/DirectedNavigationGraph

DirectedNavigationGraph

class DirectedNavigationGraph<V : Vector<V>, A : GeometricTransformation<V>, N : ConvexGeometricShape<V, A>, E>(edgeClass: Class<out E>) : BaseNavigationGraph<V, A, N, E>

A directed unweighted NavigationGraph, allowing multiple edges between the same pair of vertices and without self-loops (i.e. edges connecting a node to itself).

Constructors

fun <E> DirectedNavigationGraph(edgeClass: Class<out E>)

Functions

addEdge

abstract fun addEdge(p0: N, p1: N): E

abstract fun addEdge( p0: N, p1: N, p2: E): Boolean

addVertex

abstract fun addVertex(): N

abstract fun addVertex(p0: N): Boolean

clone

open override fun clone(): Any

containsEdge

abstract fun containsEdge(p0: E): Boolean

abstract fun containsEdge(p0: N, p1: N): Boolean

containsVertex

abstract fun containsVertex(p0: N): Boolean

degreeOf

abstract fun degreeOf(p0: N): Int

edgeSet

abstract fun edgeSet(): MutableSet<E>

edgesOf

abstract fun edgesOf(p0: N): MutableSet<E>

getAllEdges

abstract fun getAllEdges(p0: N, p1: N): MutableSet<E>

getEdge

abstract fun getEdge(p0: N, p1: N): E

getEdgeSource

abstract fun getEdgeSource(p0: E): N

getEdgeTarget

abstract fun getEdgeTarget(p0: E): N

getEdgeWeight

abstract fun getEdgeWeight(p0: E): Double

incomingEdgesOf

abstract fun incomingEdgesOf(p0: N): MutableSet<E>

inDegreeOf

abstract fun inDegreeOf(p0: N): Int

iterables

open fun iterables(): GraphIterables<N, E>

nodeContaining

open fun nodeContaining(position: V): N?

outDegreeOf

abstract fun outDegreeOf(p0: N): Int

outgoingEdgesOf

abstract fun outgoingEdgesOf(p0: N): MutableSet<E>

removeAllEdges

abstract fun removeAllEdges(p0: MutableCollection<out E>): Boolean

abstract fun removeAllEdges(p0: N, p1: N): MutableSet<E>

removeAllVertices

abstract fun removeAllVertices(p0: MutableCollection<out N>): Boolean

removeEdge

abstract fun removeEdge(p0: E): Boolean

abstract fun removeEdge(p0: N, p1: N): E

removeVertex

abstract fun removeVertex(p0: N): Boolean

setEdgeWeight

abstract fun setEdgeWeight(p0: E, p1: Double)

open fun setEdgeWeight( p0: N, p1: N, p2: Double)

vertexSet

abstract fun vertexSet(): MutableSet<N>

Properties

edgeSupplier

var edgeSupplier: Supplier<E>

type

val type: GraphType

vertexSupplier

var vertexSupplier: Supplier<N>