suvi.alg.interfaces
Interface NodeRankingPolicy

All Superinterfaces:

GraphLayoutAttrConsumer

All Known Implementing Classes:

ExplicitNodeRankingPolicy, NodeRankingPolicyContract, NodeRankingPolicyDecorator, OptimalNodeRankingPolicy, SimplisticNodeRankingPolicy

public interface NodeRankingPolicy

extends GraphLayoutAttrConsumer

Decides the rank of all nodes in the preprocessed graph.

Node ranking policies expect that:

• The preprocessed graph does not have multi-edges nor self-edges. The algorithm chassis has the responsibility to merge multi-edges and remove self-edges before passing the preprocessed graph to the node ranking policy.
• The preprocessed graph contains all the cycles of the original graph.

Whether or not some heuristic is used to break cycles in the graph before actually computing the ranking is a responsibility of each particular node ranking policy. This division of labor allows a particular node ranking policy to consider cycles in the graph while computing the ranking.

Method Summary

NodeRanking

nodeRanking(javautils.graph.adt.AugmentedGraph original, javautils.graph.adt.AugmentedGraph preprocessed, GraphTopology topology, GraphLayoutAttrMap attrMap) A node ranking for the graph.

Methods inherited from interface suvi.api.alg.attr.GraphLayoutAttrConsumer

defaultAttrs

Method Detail

nodeRanking

public NodeRanking nodeRanking(javautils.graph.adt.AugmentedGraph original,
                               javautils.graph.adt.AugmentedGraph preprocessed,
                               GraphTopology topology,
                               GraphLayoutAttrMap attrMap)

A node ranking for the graph.