0

Does Networkx have an algorithm for finding the maximum weight connected subgraph of a given order (i.e. no. of vertices)?

Marat
  • 15,215
  • 2
  • 39
  • 48
John
  • 451
  • 7
  • 17
  • 1
    You can test for the existence of a clique of size k with that primitive, so if it exists, it may not be fast enough on the graphs you care about. – David Eisenstat Dec 16 '21 at 21:46
  • [`itertools.combinations`](https://docs.python.org/3/library/itertools.html#itertools.combinations) and [induced_subgraph](https://networkx.org/documentation/stable/reference/generated/networkx.classes.function.induced_subgraph.html?highlight=induced%20subgraph#networkx.classes.function.induced_subgraph) provide the necessary ingredients for exhaustive search. – Anthony Labarre Dec 16 '21 at 23:50

0 Answers0