Directed trait. The algorithm is well-defined on a directed graph.

Undirected trait. The algorithm is well-defined on an undirected graph.

Homogeneous trait. The algorithm will treat all nodes and relationships in its input graph(s) similarly, as if they were all of the same type. If multiple types of nodes or relationships exist in the graph, this must be taken into account when analysing the results of the algorithm.