Are you certain you have not rediscovered a previously known algorithm? a common variant of Dijkstra's algorithm finds the shortest path from one node to all other nodes in a graph, using in O((V + E)log v) time and O(V + E) space (and can actually get a better big O with a Fibonacci heap, but no one uses this in practice).

So from reading your post, I'm not entirely sure what sets your algorithm apart!

If you do want to make claims about your algorithm being state of the art, I recommend trying to come up with a formal proof for the run time, and type up a manuscript in latex presenting the algorithm, a proof of correctness / runtime, and placing the algorithm into the existing literature. You can then try to send that to academics to read over, or submit to a conference as a solo author, if the work is good I don't think they will ignore you.