subgraph

It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center . Closed 8 years ago . i assume that we have 2 labeled graphs G and T and the algorithm determine if G a subgraph of T and the corresponding vertices in the main graphT and the subgraph G should have same label That problem is called "subgraph isomorphism" and it is NP-complete (and so likely to be hard). Do you need a general solution

I have two lists of vertices: V and S . I would like to generate all possible directed graphs from V and S so, that each vertex from V has only one out-edge and exactly one in-edge, and each vertex from S can have any number of in- and out- edges. Each graph in the result should contain exactly all vertices from V and from S . The result can contain both connected and disconnected graphs. First I thought it was a powerset-related problem, but powerset has many other sets that may contain just one element (and I do not need those). My current strategy is to: find all pairs between vertices from

I've been struggling with this for a while and cannot seem to find a straight answer. I'm working with compound subgraphs in graphviz and cannot seem to find the right combination of settings to force two subgraphs to align with each other. Enclosed is a simple example to show the problem... digraph g { compound=true; subgraph cluster_top { graph [color=black, label="Top", rank=min]; nodeA; nodeB; nodeC cluster_top_DUMMY [shape=point style=invis] } subgraph cluster_service { graph [color=black, label="Bottom", rank=min]; node1; node2; node3; node4; node5; extra_long_node cluster_bottom_DUMMY

I would like to get a subgraph (red area) by node: The subgraph is composed of all the nodes reachable from the input node. like G.subgraph(3) returns a new DiGraph from the red area. For example I create a DiGraph as this: import networkx as nx G = nx.DiGraph() G.add_path([1,2,3,4]) G.add_path([3,'a','b']) A = nx.to_agraph(G) A.layout() A.draw('graph.png') I looked into https://networkx.github.io/documentation/latest/reference/generated/networkx.Graph.subgraph.html and converting it to unidirectional. I tested out_egdes, strong/weak_connected_component, but its never worked. I also looked How