(concept, depth=2, centrality=BETWEENNESS)
| 56 | return concept.flatten(depth=depth) |
| 57 | |
| 58 | def properties(concept, depth=2, centrality=BETWEENNESS): |
| 59 | g = concept.graph.copy(nodes=halo(concept, depth)) |
| 60 | p = (n for n in g.nodes if n.id in concept.graph.properties) |
| 61 | p = [n.id for n in reversed(sorted(p, key=lambda n: getattr(n, centrality)))] |
| 62 | return p |
| 63 | |
| 64 | #--- RELATION -------------------------------------------------------------------------------------- |
| 65 |