Stack Overflow
Stack Overflow

Questions tagged [subgraph]

Use this tag for questions related to a Subgraph, a part of a larger graph.

313 questions
0
votes
1 answer

How can i change the graphviz.subgrah's shape to ellipse or circle?

When i use graphviz's subgraph in python, I found it's hard to change subgraph's shape from rectangle to ellipse or circle. How can i do this? the code is below from graphviz import Graph g = Graph('G', filename='fdpclust.gv', engine='fdp') …
bingxindu
  • 1
0
votes
0 answers

Python3/NetworkX. How to find only one single correct path (subgraph) in a graph, by given list of known vertices?

The task is: Given a directed graph with cycles: g = nx.MultiDiGraph() g.add_nodes_from(["","","",'','','','
LS2010
  • 121
  • 5
0
votes
1 answer

Graphviz straight lines

I am trying to get straight line edges that exit a node on the right and enter on the left. I have tried to use splines='line but it does not appear to create straight lines. Code below, as executed in jupyter notebook. from graphviz import…
amme
  • 3
  • 2
0
votes
1 answer

Size of each subgraph originating from each node in a directed cyclic graph

Is there an efficient algorithm that takes as input a directed cyclic graph and returns the size of each subgraph originating from each of the nodes? By "efficient" I mean something more efficient than carrying out DFS on each of the nodes.
panos
  • 11
0
votes
1 answer

Missing border of graphviz cluster with rank

We're trying to replace an image of diagram to graphviz graph: Current state is the following graph: digraph pipeline { node [shape=record fontname=Helvetica fontsize=10 style=filled color="#4c7aa4" fillcolor="#5b9bd5" fontcolor="white"]; …
Dmitry Kurtaev
  • 823
  • 6
  • 14
0
votes
1 answer

igraph: keeping only edges that containing vertices with different values of a vertex attribute

net is an igraph object: IGRAPH f6d0c20 UN-- 60 150 -- + attr: name (v/c), group (v/c), group1_flag (v/n), teams (v/c), ppl (v/c), ids | (v/c), value (e/n) + edges from f6d0c20 (vertex names): [1] 132--115 132--113 132--131 132--141 132--133…
J.Q
  • 971
  • 1
  • 14
  • 29
0
votes
1 answer

how to subgraph an igraph object (graph) using vertices attribute that has NA values - R

I'm trying to subgraph a graph using igraph in by filtering vertices based on the value of an attribute of the vertices. the attribute values can be NA and I want those with NA values to be excluded. here is my graph > require(igraph) > graph <-…
Ankhnesmerira
  • 1,386
  • 15
  • 29
0
votes
1 answer

Use algo on Subgraph

Let's say I have the following sub-graph (or a view): MATCH(n:Person)-[]->(m:Person) RETURN n, m; How could I run CALL algo.louvain.stream against the above result graph? And further, how could I run algo.scc on each community find by algo.louvain?…
Top.Deck
  • 1,077
  • 3
  • 16
  • 31
0
votes
2 answers

Fuzzy graph matching

I have a fuzzy graph G=(V, E) where V is the set of vertices and E is the set of edges. Every vertex is a fuzzy vertex, that means, it has a property with a membership function associated to it (stored in the vertex somehow). Every edge is a fuzzy…
Néstor
  • 351
  • 1
  • 5
  • 20
0
votes
2 answers

Using igraph subgraph_isomorphisms to find given network motifs

I'm looking for motifs of size 5 in graphs with less than 5000 nodes and less than 10000 edges. (everything uncolored) To do this I use function provided in igraph library for R subgraph_isomorphisms using method vf2 (see example below). I use…
Ian
  • 53
  • 9
0
votes
1 answer

Is there a way in neo4j to store similar subgraphs as new nodes for building ADTs over the graph data?

I'm pretty new to neo4j and actually this is my first stackoverflow question so please be gentle :) Is there an elegant solution how to group subgraphs into new nodes and use these nodes as first class citizen while still be able to expand these…
helpusobi
  • 23
  • 1
  • 6
0
votes
1 answer

creating a loop for a method that will extract all the subgraph with a triangle relationship

i am trying to make a for loop that will loop in python this method for all node in graph G that will return set/list of subgraphs. H=G.subgraph(nodes_in_triangle(G, n)) thank you.
Auwal T Amshi
  • 1
  • 1
0
votes
1 answer

Shortest paths between two sets of nodes

I created a graph in Neo4j with 10 million nodes and 30 million relationships. Each node is labeled as A (4 million nodes) , B (6 million nodes) or C (20 nodes). Nodes in A lead to nodes in B. Nodes in B lead to other nodes in B, and to nodes in…
dbank04
  • 1
  • 1
0
votes
0 answers

extract a subgraph based on nodes

I am roughly new to Networkx in python and I have a question regrading extracting a subgraphs from a huge graph using Networkx. Suppose that we need a subgraph of nodes 6,8,4 from following graph and we have no idea how many intermediate nodes would…
user3665906
  • 185
  • 13
0
votes
1 answer

Clustering subgraphs with singleton/unconnected nodes using neato engine in Graphviz

I'm hoping to generate two subgraphs with the Graphviz neato engine. One subgraph will contain nodes that are connected to each other, the other will contain singleton nodes that aren't connected to any other nodes. I have adjusted this example…
p-robot
  • 4,652
  • 2
  • 29
  • 38
1 2 3
…
20 21