Method and device for computer assisted graph processing

摘要

Nodes of a graph are grouped into at least two regions. The following steps are implemented for each region and for at least some of the nodes of the respective region:a) one node is selected as a root node;b) a tree of shortest paths is determined for the root node in the graph having the a root node as root of the tree;c) a node of an edge of the graph is marked for the region when, proceeding from the node to the root node, the edge is contained in a shortest path to the root node.