Create a new distributed community detection algorithm, attached to the
specified graph, and using the specified marker to store the community
attribute
Dijkstra's algorithm is a greedy algorithm that solves the single-source
shortest path problem for a directed graph with non negative edge weights (Wikipedia).
Computes the Dijkstra's algorithm on the given graph starting from the
given source node, considering the given attribute locates on the given
kind of elements (nodes or edges).