Hi - Neo4j beginner here.

Can the Graph Data Science 'community detection' routines operate on graphs with multiple relationships between each pair of nodes?

For example, if we have a graph in whch each pair of nodes n1 and n2 may be connected via one or more different relationships, like:

```
(n1)-[:LIVES_NEAR {weight: 0.80}]->(n2)
(n1)-[:HAS_INTERESTS_LIKE {weight: 0.55}]->(n2)
(n1)-[:HAS_JOB_LIKE {weight: 0.65}]->(n2)
```

... and we want the clustering algorithm to take all of these relationships into account when assigning these nodes to communities. (Would this be an example of a "multigraph"?)

Can we pass all of these relationships into a GDS community detection algorithm, either through wildcards or the pipe operator? I'm guessing yes, but wanted to confirm. And will the algorithm be more likely to assign a pair of nodes to the same community if they have more relationships (and possibly higher relationship weights) between them?

Or do we need to first combine this multigraph into a single graph via some aggregation scheme, and then pass the resulting single graph into the GDS algorithm?