Package org.drip.graph.astar

Interface VertexFunction

All Known Implementing Classes:

DynamicWeightFHeuristic, FHeuristic, MalikAllardFHeuristic, StaticWeightFHeuristic

public interface VertexFunction

VertexFunction exposes the Value at a Vertex. The References are:

• Dechter, R., and J. Pearl (1985): Generalized Best-first Search Strategies and the Optimality of A^* Journal of the ACM 32 (3) 505-536
• Hart, P. E., N. J. Nilsson, and B. Raphael (1968): A Formal Basis for the Heuristic Determination of the Minimum Cost Paths IEEE Transactions on Systems Sciences and Cybernetics 4 (2) 100-107
• Kagan, E., and I. Ben-Gal (2014): A Group Testing Algorithm with Online Informational Learning IIE Transactions 46 (2) 164-184
• Russell, S. J. and P. Norvig (2018): Artificial Intelligence: A Modern Approach 4^th Edition Pearson
• Wikipedia (2020): A^* Search Algorithm https://en.wikipedia.org/wiki/A*_search_algorithm

• Module = Computational Core Module
• Library = Graph Algorithm Library
• Project = Graph Optimization and Tree Construction Algorithms
• Package = A^* Heuristic Shortest Path Family

Author:

Lakshmi Krishnamurthy

Method Summary

Modifier and Type	Method	Description
double	evaluate(Vertex vertex)	Compute the Value at the Vertex

Method Details

evaluate

double evaluate(Vertex vertex)
         throws java.lang.Exception

Compute the Value at the Vertex

Parameters:

vertex - The Vertex

Returns:

The Value

Throws:

java.lang.Exception - Thrown if the Input are Invalid