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

Interface UnweightedMultiGraph<V>

Type Parameters:

V - type of the vertices

All Superinterfaces:

Graph<V>, MultiGraph<V>, java.io.Serializable, UnweightedGraph<V>

All Known Subinterfaces:

DirectedUnweightedMultiGraph<V>, UndirectedUnweightedMultiGraph<V>

All Known Implementing Classes:

FastDirectedUnweightedMultiGraph, FastUndirectedUnweightedMultiGraph

public interface UnweightedMultiGraph<V>
extends MultiGraph<V>, UnweightedGraph<V>

Interface for directed graphs.

Method Summary

Modifier and Type	Method	Description
default java.util.stream.Stream<Weights<V,java.lang.Double>>	getAdjacentNodesWeightsLists(V node)	Gets the different weights for the edges of the adjacent nodes.
default java.util.List<java.lang.Double>	getEdgeWeights(V incident, V adjacent)	Gets the weights of the different edges between two nodes, A and B.
default java.util.stream.Stream<Weights<V,java.lang.Double>>	getIncidentNodesWeightsLists(V node)	Gets the different weights for the edges of the incident nodes.
default java.util.stream.Stream<Weights<V,java.lang.Double>>	getNeighbourNodesWeightsLists(V node)	Gets the different weights for the edges of the neighbour nodes.

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

addEdge, addEdge, addEdge, addEdge, addEdge, addNode, complement, containsEdge, containsVertex, degree, degree, getAdjacencyMatrix, getAdjacencyMatrixMap, getAdjacentEdgesCount, getAdjacentMutualNodesTypes, getAdjacentNodes, getAdjacentNodesCount, getAdjacentNodesTypes, getAllNodes, getEdgeCount, getEdgeType, getIncidentEdgesCount, getIncidentMutualNodesTypes, getIncidentNodes, getIncidentNodesCount, getIncidentNodesTypes, getIsolatedNodes, getMutualEdgesCount, getMutualNodes, getMutualNodesCount, getMutualNodesTypes, getNeighbourEdgesCount, getNeighbourhood, getNeighbourhoodSize, getNeighbourhoodTypes, getNeighbourhoodWeights, getNeighbourNodes, getNeighbourNodesCount, getNeighbourNodesTypes, getNodesWithAdjacentNeighbors, getNodesWithIncidentNeighbors, getNodesWithMutualNeighbors, getNodesWithNeighbors, getNodesWithNeighbors, getVertexCount, hasAdjacentNeighbors, hasIncidentNeighbors, hasMutualNeighbors, hasNeighbors, hasNeighbors, inDegree, isDirected, isMutual, mutualDegree, outDegree, removeEdge, removeNode, updateEdgeType, updateEdgeWeight

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

getAdjacentNodesTypesLists, getEdgeTypes, getIncidentNodesTypesLists, getNeighbourhoodTypesLists, getNeighbourhoodWeightsLists, getNeighbourNodesTypesLists, getNumEdges, isMultigraph, removeEdge, removeEdges, updateEdgeWeight

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

addEdge, getAdjacentMutualNodesWeights, getAdjacentNodesWeights, getEdgeWeight, getIncidentMutualNodesWeights, getIncidentNodesWeights, getMutualNodesWeights, getNeighbourNodesWeights, isWeighted

Method Details

getIncidentNodesWeightsLists

default java.util.stream.Stream<Weights<V,java.lang.Double>> getIncidentNodesWeightsLists(V node)

Gets the different weights for the edges of the incident nodes.

Specified by:

getIncidentNodesWeightsLists in interface MultiGraph<V>

Parameters:

node - The node to study

Returns:

A stream containing the weights

getAdjacentNodesWeightsLists

default java.util.stream.Stream<Weights<V,java.lang.Double>> getAdjacentNodesWeightsLists(V node)

Gets the different weights for the edges of the adjacent nodes.

Specified by:

getAdjacentNodesWeightsLists in interface MultiGraph<V>

Parameters:

node - The node to study

Returns:

A stream containing the weights

getNeighbourNodesWeightsLists

default java.util.stream.Stream<Weights<V,java.lang.Double>> getNeighbourNodesWeightsLists(V node)

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

Specified by:

getNeighbourNodesWeightsLists in interface MultiGraph<V>

Parameters:

node - The node to study

Returns:

A stream containing the weights

getEdgeWeights

default java.util.List<java.lang.Double> getEdgeWeights(V incident, V adjacent)

Description copied from interface: MultiGraph

Gets the weights of the different edges between two nodes, A and B.

Specified by:

getEdgeWeights in interface MultiGraph<V>

Parameters:

incident - The first node of the pair.

adjacent - THe second node of the pair.

Returns:

The number of edges between the nodes.