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

Class FastUndirectedWeightedGraph<V>

java.lang.Object

es.uam.eps.ir.relison.graph.fast.AbstractFastGraph<V>

es.uam.eps.ir.relison.graph.fast.FastUndirectedWeightedGraph<V>

Type Parameters:

V - type of the nodes

All Implemented Interfaces:

FastGraph<V>, Graph<V>, UndirectedGraph<V>, UndirectedWeightedGraph<V>, WeightedGraph<V>, ReducedIndex<V>, java.io.Serializable

public class FastUndirectedWeightedGraph<V>
extends AbstractFastGraph<V>
implements UndirectedWeightedGraph<V>

Fast implementation for an Undirected Weighted graph.

See Also:

Serialized Form

Field Summary

Fields inherited from class es.uam.eps.ir.relison.graph.fast.AbstractFastGraph

edges, vertices

Constructor Summary

Constructors

Constructor	Description
FastUndirectedWeightedGraph()	Constructor for an empty graph.

Method Summary

Modifier and Type	Method	Description
double[][]	getAdjacencyMatrix(EdgeOrientation direction)	Gets the adjacency matrix.

Methods inherited from class es.uam.eps.ir.relison.graph.fast.AbstractFastGraph

addEdge, addEdge, addNode, complement, containsEdge, containsEdge, containsVertex, getAdjacencyMatrixMap, getAdjacentEdgesCount, getAdjacentMutualNodesTypes, getAdjacentMutualNodesWeights, getAdjacentNodes, getAdjacentNodesTypes, getAdjacentNodesWeights, getAllNodes, getAllNodesIds, getEdgeCount, getEdgeType, getEdgeWeight, getEdgeWeight, getIncidentEdgesCount, getIncidentMutualNodesTypes, getIncidentMutualNodesWeights, getIncidentNodes, getIncidentNodesTypes, getIncidentNodesWeights, getIndex, getIsolatedNodeIds, getIsolatedNodes, getMutualEdgesCount, getMutualNodes, getMutualNodesTypes, getMutualNodesWeights, getNeighborhood, getNeighborhoodTypes, getNeighborhoodWeights, getNeighbourhood, getNeighbourNodes, getNeighbourNodesTypes, getNeighbourNodesWeights, getNodesIdsWithEdges, getNodesWithAdjacentNeighbors, getNodesWithIncidentNeighbors, getNodesWithMutualNeighbors, getNodesWithNeighbors, getNodesWithNeighbors, getVertexCount, hasAdjacentNeighbors, hasIncidentNeighbors, hasMutualNeighbors, hasNeighbors, idx2object, object2idx, removeEdge, removeNode, updateEdgeType, updateEdgeWeight, updateEdgeWeight

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

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

addEdge, addEdge, addEdge, addEdge, addEdge, addEdge, addNode, complement, containsEdge, containsVertex, getAdjacencyMatrixMap, getAdjacentMutualNodesWeights, getAdjacentNodesCount, getAllNodes, getEdgeCount, getEdgeType, getEdgeWeight, getIncidentMutualNodesWeights, getIncidentNodesCount, getIsolatedNodes, getMutualNodesWeights, getNeighbourNodes, getNeighbourNodesCount, getNeighbourNodesTypes, getNodesWithAdjacentNeighbors, getNodesWithIncidentNeighbors, getNodesWithMutualNeighbors, getNodesWithNeighbors, getNodesWithNeighbors, getVertexCount, hasAdjacentNeighbors, hasIncidentNeighbors, hasMutualNeighbors, hasNeighbors, hasNeighbors, isMultigraph, removeEdge, removeNode, updateEdgeType, updateEdgeWeight

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

degree, degree, getAdjacentEdgesCount, getAdjacentMutualNodesTypes, getAdjacentNodes, getAdjacentNodesTypes, getIncidentEdgesCount, getIncidentMutualNodesTypes, getIncidentNodes, getIncidentNodesTypes, getMutualEdgesCount, getMutualNodes, getMutualNodesCount, getMutualNodesTypes, getNeighbourEdgesCount, getNeighbourhood, getNeighbourhoodSize, getNeighbourhoodTypes, inDegree, isDirected, isMutual, mutualDegree, outDegree

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

getAdjacentNodesWeights, getIncidentNodesWeights, getNeighbourhoodWeights, getNeighbourNodesWeights

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

isWeighted

Constructor Details

FastUndirectedWeightedGraph

public FastUndirectedWeightedGraph()

Constructor for an empty graph.

Method Details

getAdjacencyMatrix

public double[][] getAdjacencyMatrix(EdgeOrientation direction)

Description copied from interface: Graph

Gets the adjacency matrix.

Specified by:

getAdjacencyMatrix in interface Graph<V>

Parameters:

direction - The direction of the edges.

Returns:

the adjacency matrix.