Package es.uam.eps.ir.relison.graph.multigraph

Interface DirectedMultiGraph<U>

Type Parameters:

U - type of the vertices

All Superinterfaces:

DirectedGraph<U>, Graph<U>, MultiGraph<U>, java.io.Serializable

All Known Subinterfaces:

DirectedUnweightedMultiGraph<V>, DirectedWeightedMultiGraph<U>

All Known Implementing Classes:

FastDirectedUnweightedMultiGraph, FastDirectedWeightedMultiGraph

public interface DirectedMultiGraph<U>
extends MultiGraph<U>, DirectedGraph<U>

Interface for directed multi graphs.

Method Summary

Modifier and Type	Method	Description
default java.util.stream.Stream<Weights<U,java.lang.Integer>>	getNeighbourhoodTypesLists(U node, EdgeOrientation direction)	Gets the different weights for the edges of the selected neighbour nodes.
default java.util.stream.Stream<Weights<U,java.lang.Double>>	getNeighbourhoodWeightsLists(U node, EdgeOrientation direction)	Gets the different weights for the edges of the selected neighbour nodes.
default int	inDegree(U node)	Calculates the in-degree of a node.
default int	outDegree(U node)	Calculates the out-degree of a node.

Methods inherited from interface es.uam.eps.ir.relison.graph.DirectedGraph

degree, degree, getNeighbourEdgesCount, getNeighbourhood, getNeighbourhoodSize, getNeighbourhoodTypes, getNeighbourhoodWeights, getSinks, getSources, isDirected, mutualDegree

Methods inherited from interface es.uam.eps.ir.relison.graph.Graph

addEdge, addEdge, addEdge, addEdge, addEdge, addEdge, addNode, complement, containsEdge, containsVertex, getAdjacencyMatrix, getAdjacencyMatrixMap, getAdjacentEdgesCount, getAdjacentMutualNodesTypes, getAdjacentMutualNodesWeights, getAdjacentNodes, getAdjacentNodesCount, getAdjacentNodesTypes, getAdjacentNodesWeights, getAllNodes, getEdgeCount, getEdgeType, getEdgeWeight, getIncidentEdgesCount, getIncidentMutualNodesTypes, getIncidentMutualNodesWeights, getIncidentNodes, getIncidentNodesCount, getIncidentNodesTypes, getIncidentNodesWeights, getIsolatedNodes, getMutualEdgesCount, getMutualNodes, getMutualNodesCount, getMutualNodesTypes, getMutualNodesWeights, getNeighbourNodes, getNeighbourNodesCount, getNeighbourNodesTypes, getNeighbourNodesWeights, getNodesWithAdjacentNeighbors, getNodesWithIncidentNeighbors, getNodesWithMutualNeighbors, getNodesWithNeighbors, getNodesWithNeighbors, getVertexCount, hasAdjacentNeighbors, hasIncidentNeighbors, hasMutualNeighbors, hasNeighbors, hasNeighbors, isMutual, isWeighted, removeEdge, removeNode, updateEdgeType, updateEdgeWeight

Methods inherited from interface es.uam.eps.ir.relison.graph.multigraph.MultiGraph

getAdjacentNodesTypesLists, getAdjacentNodesWeightsLists, getEdgeTypes, getEdgeWeights, getIncidentNodesTypesLists, getIncidentNodesWeightsLists, getNeighbourNodesTypesLists, getNeighbourNodesWeightsLists, getNumEdges, isMultigraph, removeEdge, removeEdges, updateEdgeWeight

Method Details

getNeighbourhoodWeightsLists

default java.util.stream.Stream<Weights<U,java.lang.Double>> getNeighbourhoodWeightsLists(U node, EdgeOrientation direction)

Description copied from interface: MultiGraph

Gets the different weights for the edges of the selected neighbour nodes.

Specified by:

getNeighbourhoodWeightsLists in interface MultiGraph<U>

Parameters:

node - The node to study

direction - The orientation to take

Returns:

A stream containing the weights

getNeighbourhoodTypesLists

default java.util.stream.Stream<Weights<U,java.lang.Integer>> getNeighbourhoodTypesLists(U node, EdgeOrientation direction)

Description copied from interface: MultiGraph

Gets the different weights for the edges of the selected neighbour nodes.

Specified by:

getNeighbourhoodTypesLists in interface MultiGraph<U>

Parameters:

node - The node to study

direction - The orientation to take

Returns:

A stream containing the weights

inDegree

default int inDegree(U node)

Description copied from interface: Graph

Calculates the in-degree of a node.

Specified by:

inDegree in interface DirectedGraph<U>

Specified by:

inDegree in interface Graph<U>

Parameters:

node - The node.

Returns:

the in-degree of the node if it is contained in the graph, -1 otherwise.

outDegree

default int outDegree(U node)

Description copied from interface: Graph

Calculates the out-degree of a node.

Specified by:

outDegree in interface DirectedGraph<U>

Specified by:

outDegree in interface Graph<U>

Parameters:

node - The node.

Returns:

the out-degree of the node if it is contained in the graph, -1 otherwise.