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

Violin Plot Matlab

I am trying to find source code to create violin plots in Matlab. Functionality does not exist in the statistics toolbox nor does a simple Google result in anything useful.
Elpezmuerto
  • 5,391
  • 20
  • 65
  • 79
6
votes
2 answers

Cosmos DB Graph Edge partitioning

Cosmos DB has pre-announced general availability of Gremlin (Graph API). Probably by the end of 2017 it will get out of preview, so we might consider it stable enough for production. That brings me to the following: We are designing a system with an…
cldons
  • 120
  • 6
6
votes
2 answers

How to apply two different type to an edge in sigma.js

I'm trying to draw edges in a sigma.js graph DOTTED and CURVED. I'm using customEdgeShapes and curve plugins but I cannot combine two different styles in the same edge. In fact I can only apply a single style to the type attribute: edge.type =…
rvandoni
  • 3,297
  • 4
  • 32
  • 46
6
votes
1 answer

HTS package: how to specify a network-like hierarchy of forecasts?

I'm trying to use the hts package for hierarchical forecasting in order to predict together the different scales of a water network, in order to have reconciled forecasts. The water network is composed of flowmeters, that measure flow in positive or…
agenis
  • 8,069
  • 5
  • 53
  • 102
6
votes
2 answers

Stop boost::depth_first_search along a particular depth if certain criteria is met

I'm using BGL to store my DAG. Vertices have states. Given a change in state in one of the vertices i want to update dependent vertices. This i'm able to do using boost::depth_first_search and a custom visitor. Now the logic is that i dont want to…
Vikas
  • 8,790
  • 4
  • 38
  • 48
6
votes
4 answers

Is there a term to describe all non-root nodes in a tree?

Root covers the root, what are the rest of the nodes collectively called?
glenn
  • 651
  • 1
  • 6
  • 14
6
votes
1 answer

Graph as adjacency matrix time complexity

I don't understand why inserting an edge in adjacency matrix takes O(1) time. For example we want to add an edge from vertex 3 to 5, in oriented graph we need to change graph[2][4] to 1. In oriented do the other way round also. How can it possible…
Margo
  • 348
  • 2
  • 3
  • 13
6
votes
8 answers

number of paths in graph

how could the number of paths in a directed graph calculated? Are there any algorithms for this purpose? Best wishes EDIT: The graph is not a tree.
sa11
  • 123
  • 1
  • 6
6
votes
1 answer

How to control width of graph line in matplotlib?

I am trying to plot line graphs in matplotlib with the following data, x,y points belonging to same id is one line, so there are 3 lines in the below df. id x y 0 1 0.50 0.0 1 1 1.00 0.3 2 1 1.50 …
abcdef
  • 105
  • 1
  • 1
  • 6
6
votes
3 answers

finding all minimal spanning trees

Possible Duplicate: All minimum spanning trees implementation How can I find all minimum spanning trees in an undirected graph in an efficient way?
user182513
6
votes
3 answers

How to count all the connected nodes (rows) in a graph on Postgres?

My table has account_id and device_id. One account_id could have multiple device_ids and vice versa. I am trying to count the depth of each connected many-to-many relationship. Ex: account_id | device_id 1 | 10 1 | 11 1 | 12 2 | 10 3 | 11 3 | 13 3 |…
cvax
  • 416
  • 1
  • 5
  • 12
6
votes
2 answers

Should I use JanusGraph as main database to store all my data for a new project?

I'm thinking about learn JanusGraph to use in my new big project but i can't understand some things. Janus can be used like any database and supports "insert", "update", "delete" operations so JanusGraph will write data into Cassandra or other…
Augusto Will
  • 562
  • 7
  • 20
6
votes
3 answers

Algorithm to find disconnected graph from sets

Goal: Want to efficiently find all the disconnected graphs from a large collection of sets For example, I have a data file like the following: A, B, C C, D, E A, F, Z G, J ... each entry represents a set of element. First entries A, B, C = {A, B,…
Junwei su
  • 138
  • 1
  • 10
6
votes
3 answers

How does graph6 format work?

I've been looking all over the place on how the .g6 or graph6 format works and I have no idea how it even works I swear it's like magic. F?B~w That is a graph represented in ASCII form. It can be interpreted by Wolfram Mathematica, Sage, and Maple…
Sailanarmo
  • 1,139
  • 15
  • 41
6
votes
3 answers

How do I transform an undirected, very cyclic graph into a directed acyclic graph?

I'm working on a modified TopSort algorithm and am having trouble finding / creating large (more than 1000 nodes) directed acyclic graphs to use for testing. I have an undirected sample graph from another project that is of a good size, but has many…
Frank D.
  • 61
  • 1
  • 2
1 2 3
…
99 100