How to find the shortest path in a graph with a heuristic algorithm?

Question

C++ / C#

Hello,
a weighted undirected graph is given by an adjacency matrix. need a heuristic algorithm to find the shortest path between two points. I understood A * and ants, in the end nothing good came of it.

Answer 1

The simplest heuristic - find some path and optimize it until you get bored

Answer 2

www.redblobgames.com Pathfinding
examples here

Answer 3

Start simple, with Dijkstra: e-maxx.ru/algo/dijkstra

Answer 4

HEURISTICS - A set of research methods that contribute to the discovery of the previously unknown.
That is, "heuristic" is a method that "does something smart and useful", that is, nothing specific. As uvelichitel already said, start with any algorithm, then look for more optimal ways, as this is another question.