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

Class FastDirectedUnweightedGraph<V>

java.lang.Object

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

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

Type Parameters:

V - Type of the vertices.

All Implemented Interfaces:

DirectedGraph<V>, DirectedUnweightedGraph<V>, FastGraph<V>, Graph<V>, UnweightedGraph<V>, ReducedIndex<V>, java.io.Serializable

public class FastDirectedUnweightedGraph<V>
extends AbstractFastGraph<V>
implements DirectedUnweightedGraph<V>

Fast implementation for a directed unweighted graph. This implementation does not allow removing edges.

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
FastDirectedUnweightedGraph()	Constructor.

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.DirectedGraph

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

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

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

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

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

Constructor Details

FastDirectedUnweightedGraph

public FastDirectedUnweightedGraph()

Constructor.

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.