-1

I am looking for a graph theory package in Python or C++ that enables me to create edges between subgraphs/clusters and their nodes at will, as depicted in the accepted answer to this question, to assign properties to all those objects (the nodes, the clusters, the node-node edges, node-cluster edges, cluster-cluster edges), and perform calculations with those properties.

It appears to be impossible in NetworkX. Please note I am not referring to merely drawing these images.

Question: Does iGraph, graph_tool, or some other package offer this feature?

Eric Inclan
  • 327
  • 1
  • 5
  • 14
  • 2
    Both, networkx and igraph (and I assume graph-tool as well but I have never used it much) model graphs purely as collections of edges. Both have objects corresponding to node clusters or partitions, but there is no notion of node-cluster or cluster-cluster edges. You could implement that pretty easily in a hypergraph / multi-edge graph, for example, but you would have to define the behaviour of such a graph yourself. – Paul Brodersen Aug 20 '18 at 11:49
  • Your comment actually answers all my questions (I was wondering about hypergraphs as well ... learning all of this as I go). If you post it as an answer I'll upvote and accept. Thank you! – Eric Inclan Aug 20 '18 at 13:31

1 Answers1

0

Found this python package for hypergraphs: http://murali-group.github.io/halp/

Their first and last stable release was 2014.

Eric Inclan
  • 327
  • 1
  • 5
  • 14