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

UndirectedNavigationGraph

class UndirectedNavigationGraph<V : Vector<V>, A : GeometricTransformation<V>, N : ConvexGeometricShape<V, A>, E>(edgeClass: Class<out E>) : BaseNavigationGraph<V, A, N, E>
Content copied to clipboard

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

Constructors

Link copied to clipboard
fun <E> UndirectedNavigationGraph(edgeClass: Class<out E>)
Content copied to clipboard

Functions

Link copied to clipboard
abstract fun addEdge(p0: N, p1: N): E
Content copied to clipboard
abstract fun addEdge(    p0: N,     p1: N,     p2: E): Boolean
Content copied to clipboard
Link copied to clipboard
abstract fun addVertex(): N
Content copied to clipboard
abstract fun addVertex(p0: N): Boolean
Content copied to clipboard
Link copied to clipboard
open override fun clone(): Any
Content copied to clipboard
Link copied to clipboard
abstract fun containsEdge(p0: E): Boolean
Content copied to clipboard
abstract fun containsEdge(p0: N, p1: N): Boolean
Content copied to clipboard
Link copied to clipboard
abstract fun containsVertex(p0: N): Boolean
Content copied to clipboard
Link copied to clipboard
abstract fun degreeOf(p0: N): Int
Content copied to clipboard
Link copied to clipboard
abstract fun edgeSet(): MutableSet<E>
Content copied to clipboard
Link copied to clipboard
abstract fun edgesOf(p0: N): MutableSet<E>
Content copied to clipboard
Link copied to clipboard
abstract fun getAllEdges(p0: N, p1: N): MutableSet<E>
Content copied to clipboard
Link copied to clipboard
abstract fun getEdge(p0: N, p1: N): E
Content copied to clipboard
Link copied to clipboard
abstract fun getEdgeSource(p0: E): N
Content copied to clipboard
Link copied to clipboard
abstract fun getEdgeTarget(p0: E): N
Content copied to clipboard
Link copied to clipboard
abstract fun getEdgeWeight(p0: E): Double
Content copied to clipboard
Link copied to clipboard
abstract fun incomingEdgesOf(p0: N): MutableSet<E>
Content copied to clipboard
Link copied to clipboard
abstract fun inDegreeOf(p0: N): Int
Content copied to clipboard
Link copied to clipboard
open fun iterables(): GraphIterables<N, E>
Content copied to clipboard
Link copied to clipboard
open fun nodeContaining(position: V): N?
Content copied to clipboard
Link copied to clipboard
abstract fun outDegreeOf(p0: N): Int
Content copied to clipboard
Link copied to clipboard
abstract fun outgoingEdgesOf(p0: N): MutableSet<E>
Content copied to clipboard
Link copied to clipboard
abstract fun removeAllEdges(p0: MutableCollection<out E>): Boolean
Content copied to clipboard
abstract fun removeAllEdges(p0: N, p1: N): MutableSet<E>
Content copied to clipboard
Link copied to clipboard
abstract fun removeAllVertices(p0: MutableCollection<out N>): Boolean
Content copied to clipboard
Link copied to clipboard
abstract fun removeEdge(p0: E): Boolean
Content copied to clipboard
abstract fun removeEdge(p0: N, p1: N): E
Content copied to clipboard
Link copied to clipboard
abstract fun removeVertex(p0: N): Boolean
Content copied to clipboard
Link copied to clipboard
abstract fun setEdgeWeight(p0: E, p1: Double)
Content copied to clipboard
open fun setEdgeWeight(    p0: N,     p1: N,     p2: Double)
Content copied to clipboard
Link copied to clipboard
abstract fun vertexSet(): MutableSet<N>
Content copied to clipboard

Properties

Link copied to clipboard
var edgeSupplier: Supplier<E>
Content copied to clipboard
Link copied to clipboard
val type: GraphType
Content copied to clipboard
Link copied to clipboard
var vertexSupplier: Supplier<N>
Content copied to clipboard