Use this tag for questions related to a Subgraph, a part of a larger graph.
Questions tagged [subgraph]
313 questions
0
votes
1 answer
finding all paths in a graph including a vertex
I have a directed simple graph (named tutti) and a list of vertex (named risultato).
I want to find the full set of subgraph extracted by "tutti" that includes a vertex in the array risultato.
As example in the included picture the graph tutti …
Alex Fort
- 93
- 6
0
votes
1 answer
To find number of patterns
For a dataset like:
21 79
78 245
21 186
65 522
4 21
3 4
4 212
4 881
124 303
28 653
28 1231
7 464
7 52
17 102
16 292
65 837
28 203
28 1689
136 2216
7 1342
56 412
I need to find the number of associated patterns. For example…
phoenix
- 335
- 1
- 4
- 19
0
votes
1 answer
Graphviz render nodes in subgraph, why?
I want to show a node a pointing to a node b. b is in a subgraph.
The following dot graphviz code should work.
digraph
{
a;
subgraph cluster_mysubgraph
{
a->b;
}
}
Alas, while the node a is declared outside of any…
Stéphane Gourichon
- 6,493
- 4
- 37
- 48
0
votes
2 answers
Neo4j traversal for subgraph
I want to extract the subgraph from Neo4j graph database.The input will be two nodes. we need to find all the one-hop neighbors from both nodes and form the union of nodes(let's call it closure). Now we have to get all the relationships in this…
Sandeep
- 53
- 1
- 7
0
votes
1 answer
Neo4J: Query nodes where any pair of nodes are connected by a certain number of different relations?
How to build a Neo4J query that:
1) Will return all nodes where any pair of nodes are connected by a certain number of different relations? For example, nodes connected by 2, 3 or 5 different relations?
So instead of a query returning connected…
DarqMoth
- 603
- 1
- 13
- 31
0
votes
1 answer
Neo4J: find a sub-graph of arbitrary depth with nodes connected by a given set of relations?
How to build a Neo4J query that:
1) Will return all nodes in a sub-graph of arbitrary depth with nodes connected by a given set of relations?
For example in Cypher-like syntax:
MATCH (*)-[r1:FRIEND_OF AND r2:COLLEAGUE_WITH]->(*) RETURN *
DarqMoth
- 603
- 1
- 13
- 31
0
votes
1 answer
Return vertexes of separate subgraph
I have this graph:
df<-data.frame(x=c('a','b','c'),y=c('d','c','f'))
g<-graph.data.frame(df,directed=F)
is there a way to return two lists of vertexes according to which subgraph they belong?
I'd like to get to this output:
vertex id
1 a 1
2…
zunio
- 1
0
votes
1 answer
Get Subgraph for Neo4j embedded graph database using Java
I want to get the first hop neighbour nodes of some given set of nodes. After getting all the neighbour nodes, i want to get all the relationships existing between these neighbour nodes. I am not able to write cypher query for this.
Sandeep
- 53
- 1
- 7
0
votes
1 answer
Add/update labels to a d3.js graph
I'm new to d3.js, and I struggle with the syntax.
I usually know how to add labels to a graph... but not with this code (which I have taken from D3.js Force Layout - showing only part of a graph )
I have tried the various solutions […
user1788720
- 327
- 2
- 11
0
votes
1 answer
weighted subgraph isomorphism
I've been searching this all over the internet for about two or three consecutive days, but no luck so far.
I know that there are lots of libraries and implementation for subgraph isomorphism in the wild, but they all work for unweighted graphs. For…
Yaser Kenesh
- 81
- 1
- 9
0
votes
1 answer
Maximum N-noded connected subgraph in a node-weighted graph
Take this node weighted graph for example :
The maximum subgraph containing exactly 1 node (and the 'entry point') would be 14.
The maximum subgraph containing exactly 2 nodes (and the 'entry point') would be 14 / 9.
The maximum subgraph…
0
votes
1 answer
BGL : How do I get a list of subgraphs, given a graph?
I have a boost adjacency_list, which is my main graph. To this graph, I added some subgraphs using the create_subgraph function.
My question is, how can I get the list of subgraphs I just created without storing the Graph objects?
eg:
Graph g; //…
YshfOp
- 1
- 2
0
votes
1 answer
Induced subgraphs in neo4j
I have a graph in neo4j, and for a given node N, I would like to find all nodes that are reachable in a path of no longer than P steps from N, as well as all links between that set of nodes. It seems like this could be possible with either Cypher…
betseyb
- 1,302
- 2
- 18
- 37
0
votes
1 answer
Networkx, DIAC graph, subgraph from a node with deph limit
I have a Digraph constructed with networkx that has 37379 nodes and 61263 edges. I would like to extract for a node target, a subgraph that contain only the target node and the first nodes that are linked to it.
I tried the answers here and it only…
qdelettre
- 1,873
- 5
- 25
- 36
0
votes
1 answer
Extracting subgraphs (cliques) within graph on Netlogo
I have a netlogo question. I have some graph structures of nodes connected with (undirected) links. I need to figure out which is the smallest subgraph within one of these structures. Basically subgraph means which nodes are all connected between…
Atirag
- 1,660
- 7
- 32
- 60