Stack Overflow
Stack Overflow

Questions tagged [graph]

This "graph" tag refers to a graphical data presentation, e.g. chart or diagram. For the mathematical concept use [graph-theory].

A graph is a visual representation of the relationship between two or more variables. Graphs are especially useful for recognizing broad trends or patterns in large data-sets, and thus are often used for visualising scientific data.

Related tags:

For graphs in discrete mathematics (consisting of nodes/vertices and edges/arcs/relationships which connect pairs of these nodes/vertices), please use . You might also include one of the following tags:

  • for questions on graph-related algorithms.
  • for questions on database technologies for persisting and querying graphs.
28721 questions
6
votes
1 answer

Predecessor in graphs?

Does the term "predecessor" of a node mean the node that IMMEDIATELY precedes that node ( i.e. is parent of the node) or does it refer to a node at a distance k above that node where k>=1.
Programmer
  • 6,565
  • 25
  • 78
  • 125
6
votes
1 answer

Datamodel for Property Graph over HBase/Cassandra

I'm willing to store a Property Graph into HBase. A Property Graph is a graph nodes and edges have properties and multiple edges can link the same tuple of nodes as long as the edges belong to different types. My query pattern will be either…
marcorossi
  • 71
  • 3
6
votes
3 answers

Why are you guaranteed to find your result if it is in the graph with BFS but not with DFS?

I've read somewhere that DFS is not gaurenteed to find a solution while BFS is.. why? I don't really get how this is true.. could someone demonstrate a case for me that proves this?
Skizit
  • 43,506
  • 91
  • 209
  • 269
6
votes
3 answers

networkx maximal_matching() does not return maximum matching

I'm learning to use the networkx python module to do some matchings of a bipartite graph. There are two functions in the module that give the maximum cardinality matching of a graph: nx.maximal_matching() nx.bipartite.maxmum_matching() Note that…
Jason
  • 2,950
  • 2
  • 30
  • 50
6
votes
1 answer

NetworkX node labels relative position

I am struggling with the following problem. I want to plot a circular graph of about 100 nodes where I have to manually position them, according to a classification done previously. These nodes have an assigned label which describes them, with…
adriaat
  • 117
  • 1
  • 8
6
votes
3 answers

Ways to persist Guava Graph

I'm using the common.graph from Google Guava in Version 21.0. It suits very well to my usecase without one aspect: Persistence. The graph seems to be in-memory only. The graph-classes does not implement Serializable, it was explained in this issue…
Gersee
  • 806
  • 3
  • 15
  • 30
6
votes
2 answers

How to create a connected graph in networkx

I want to create a connected graph in IPython notebook through NetworkX. Previously, I use erdos_renyi_graph to generate a random graph, but I never get a connected graph, I want to use this graph to prove that my graph is a small world network.…
lala
  • 291
  • 1
  • 3
  • 9
6
votes
1 answer

Trajectory Clustering/ Aggregation with Python

I’m working with geo-located social media posts and clustering their locations (latitude/longitude) using DBSCAN. In my data set, I have many users who have posted multiple times, which allows me to derive their trajectory (a time ordered sequence…
andrewr
  • 784
  • 13
  • 31
6
votes
0 answers

Unable to load the "nvidia-drm" kernel module

I am trying to install Nvidia driver on Ubuntu. I am following the structure mentioned here, but still the above error coming up.
Amn Kh
  • 531
  • 3
  • 7
  • 19
6
votes
0 answers

Facebook Workplace API authentication

I'm developing a web application that integrates with Facebook's Workplace. I've spent the whole day trying to figure out how to use OAUTH authentication mechanism for member authentication. Since I have the app access token I'm able to get member…
Esteban N
  • 71
  • 1
6
votes
2 answers

probability of each terminal node in a directed graph

I have a directed graph G(V,E) and weight w(u,v). In this graph weight w(u,v) represents how many times the node(v) has visited from node(u). for example(See this for a directed graph image): 1 3 A ----- B ----- D | \____/| 1| 4 …
ydrall
  • 338
  • 1
  • 3
  • 11
6
votes
1 answer

flot graph, use legend to turn on/off series

I want to be able to use the legend of a flot graph to turn on/off the series of my graph. I found the examples on the flot site and have used the Turning series on/off and Labelformatter from the API to build what I have right now. I can put…
Matt Heffernan
  • 153
  • 1
  • 2
  • 11
6
votes
1 answer

AttributeError: module 'networkx' has no attribute 'Graph'

I installed networkx by downloading the distribution file and running: python setup.py install It appears to have been successful, I got this message after installing Installed…
NBC
  • 1,606
  • 4
  • 18
  • 31
6
votes
2 answers

Plotting the implicit function x+y - log(x) - log(y) -2 = 0 on MATLAB

I wanted to plot the above function on Matlab so I used the following code ezplot('-log(x)-log(y)+x+y-2',[-10 10 -10 10]); However I'm just getting a blank screen. But clearly there is at least the point (1,1) that satisfies the equation. I don't…
DDDAD
  • 255
  • 3
  • 9
6
votes
2 answers

DFS on disconnected Graphs

How does DFS(G,v) behaves for disconnected graphs ? Suppose a graph has 3 connected components and DFS is applied on one of these 3 Connected components, then do we visit every component or just the on whose vertex DFS is applied. Means Is it…
mcjoshi
  • 299
  • 1
  • 4
  • 11
1 2 3
…
99
100