VertexScoringAlgorithm (JGraphT : a free Java graph library)

Type Parameters:

V - the vertex type

D - the score type

All Known Implementing Classes:

ApBetweennessCentrality, BetweennessCentrality, ClosenessCentrality, ClusteringCoefficient, Coreness, EigenvectorCentrality, HarmonicCentrality, KatzCentrality, PageRank
```
public interface VertexScoringAlgorithm<V,D>
```
An interface for all algorithms which assign scores to vertices of a graph.

Author:

Dimitrios Michail

Method Summary

All Methods Instance Methods Abstract Methods
Modifier and Type	Method	Description
`Map<V,D>`	`getScores()`	Get a map with the scores of all vertices
`D`	`getVertexScore(V v)`	Get a vertex score

- Method Detail
  - getScores
```
Map<V,D> getScores()
```
    Get a map with the scores of all vertices
    
    Returns:
    
    a map with all scores
  - getVertexScore
```
D getVertexScore(V v)
```
    Get a vertex score
    
    Parameters:
    
    v - the vertex
    
    Returns:
    
    the score