I'm working on Dijkstra's algorithm, and I really need to find all the possible shortest paths, not just one. I'm using an adjacency matrix and I applied Dijkstra's algorithm, and I can find the shortest path. But I need to find all the paths with that minimum cost, I mean all the possible solutions, if they exist.
This is how my algorithm works, for a single solution:
public void dijkstra( int graph[][] )
{
int d[] = new int[ graph.length ];
int dC[] = new int[ graph.length ];
int

I have a US spatial map connecting cities with weights (distances). I'd like to find the longest (most weighted) trail in this map.
each edge is visited 0 or 1 times
each node can be visited [0, inf) times.
There's NO requirement that all the nodes or the edges need to be visited.
Method and prolog resources suggestions would be fine.

Hi there I've been working with neo4j and tree data and so far it's worked out great. However, I can't seem to find much documentation on how the pattern matching generally works so I can verify if a query I'm making will have the predicted result.
I have a tree with nodes 1, 2, 3, 4, where 2 is a child of 1 and 3 + 4 are both children of 2. There are directed edges from 1 to 2, 2 to 3 and 2 to 4. If I execute the following Cypher query, will I always get the most recent common ancestor for the

I am making a stacked area graph.
series A should be under series B
Since it's not possible to invert the stacking order I had to reverse the series order so that chart.series[0] is the series B and chart.series1 series A.
I can reverse the order of the legend to present the series A before series B.
But I still have a problem with the shared tooltip where the series A is displayed below the series B.
Is there a solution to change the order of the tooltip ?
$(document).ready(function()

Tags： Graph
core-plotaxis-labels
I have successfully created two series (one in each plot space) with each using its own scale. I created the axes with this code:
CPTXYAxisSet *axisSet = (CPTXYAxisSet *) self.hostView.hostedGraph.axisSet;
CPTXYAxis *x = axisSet.xAxis;
CPTXYAxis *y = axisSet.yAxis;
CPTXYAxis *y2 = axisSet.yAxis;
y.plotSpace = plotSpace;
y2.plotSpace = plotSpace2;
graph.axisSet.axes = [NSArray arrayWithObjects:x, y, y2, nil];
The code works correctly for setting the properties of y, but when the code reaches

Tags： Graph
depth-first-search
I had a question abt the running time of DFS. i know its O(n + m) but according to wikipedia, there is another running time given: O(b^d). what is the difference btw the two or is it the same representation.
this is what was written in wikipedia:"O(|E|) for explicit graphs traversed without repetition, O(b^d) for implicit graphs"

In Stata I try to create a graph that combines 9 bar graphs with the following code:
graph bar perc_not_like if x002_02a == 352 | x002_02a == 208 | x002_02a == 246 | x002_02a == 264 | ///
x002_02a == 578 | x002_02a == 752, title("Northern European Countries") ytitle(% of people that do not like immigrants) by(x002_02a)
The point is that I want only one title. What actually happens with the aforementioned code is that for each bar graph there is a title, which makes

I want to plot N different linear functions in a graph using gnuplot.
Furthermore, I have to colors, lets say red and black.
I want to plot all functions with different colors, so that the first function is red, the Nth is black, and the color of all functions in between is interpolated.
How can I do this using gnuplot?
Note: N is not fixed, so I would like gnuplot to do the interpolation.
Something like this, which I quickly hacked together in Paint:

How the forum TinkerPop can be addressed? Is it going to specify a standard for the Graph DBs and the related technology Frameworks? In this effort TinkerPop is considered as an authority or pioneer in some sense? I was not able to understand these by going through TinkerPop homepage.Thanks.

I am using one of jMeter plugins 'JP@GC response times over time' to display results and I would like to change the look of that graph.
Is there any way to do so ? For instance changing the font in the above mentioned graph.
Thank you.

I know Export["image.png", image, ImageResolution -> 300].
But it there a way to set the default value for ImageResolution?

I have a large (un-directed and un-weighted) graph and I'm interested in calculating the shortest paths (BFS) between all of the 4-touples in the graph. Trivial way takes a complexity of n^4.
Now, suppose that I have more than one core dedicated for this task.
Is there an intelligent way to use Map-Reduce for my task? i.e. splitting this task into smaller independent task? Is there a framework that will allow me splitting the problem into smaller ones and performing calculation in parallel.
T

I want to represent my city's road network in geotool's graph object. Since road network is hybrid, it has one way roads and two ways roads. I cannot find a graph generator that allows to generate directed and undirected edges in same graph. There are graph generators for all directed or all undirected edges. So what is the most efficient way of representing road network in geotool's graph object. Directivity is important for me because I have to run routing algorithms, plus adding two edges (in

I need to draw a histogram to make comparison between two series. I have the following code, but the proc gchart is not working.
data test;
input date $ irate ppi savings income cpi;
datalines;
JUN1990 8.43 114.3 2.412 83.83 129.9
JUL1990 8.76 114.5 2.473 68.147 130.4
AUG1990 8.94 116.5 4.594 84.205 131.6
SEP1990 8.85 118.4 3.893 84.016 132.7
OCT1990 8.67 120.8 3.816 52.269 133.5
NOV1990 8.51 120.1 5.35 97.008 133.8
DEC1990 8.13 118.7

Tags： Graph
graph-databasesgremlintinkerpop
I am trying to get a list of shortest paths from a given start node to all nodes that are within a given range. Each edge is weighted and I am trying to use the sum of these weights as the range, rather than the number of steps.
The following works for limiting steps, but I'm not sure how to aggregate and limit path edge weights or return paths properly.
g.v(1).out.loop(1){it.loops < 3}{true}.dedup
Thanks for any help!

I'm trying to make a constraint to check if there is a path from a vertex A to a vertex B in a graph. I've already made a constraint that returns the path itself, but I also need a function that returns a bool indicating if the path exists or not.
I've already spent a lot of time on it, but none of my tries was successful...
Does anyone has any idea of what could I do?
Here is the function that I've made that returns the path itself, wherein graph is an adjacency matrix and source and target

Tags： Graph
shortest-pathfloyd-warshall
I created an oriented dependency graph of semantique web service where nodes are web services and there is an edge between two services if they can be composed(the output of one are similares to the input of the other). the weight is a function depending on Quality of service and similarity
When I get a service request that need a composition of many services, I need the find the shortest path to get the response>
so given the user request (inputs and outputs), I can find the starts and end no

I would like to find circles like this a1->a2->a3->a1 where each transaction differs by less than 20% from the previous one. The below query works well.
My question is: How do I make it more generic by parametrising circle length?
match p=(a1:Account { id:'123'})-[t1:Transaction]->(a2:Account)-[t2:Transaction]->(a3:Account)-[t3:Transaction]->(a1)
where a1<>a2<>a3<>a1
and 0.8*t1.amount<t2.amount<1.2*t1.amount
and 0.8*t2.amount<t3.amount<1.2*t2.amount

does any body know how to show a graph?
by a graph I mean connectivity graph and by showing it I mean see a picture of it while you have it's adj list.
UPD 1 : by see ing a picuter of it I mean does any body know any kjnd of website or app that it get graph adj list as an input and give us picture of that graph as an output ?!

I have a dataset of people who like shops. and shops located in regions. The people also live in the regions.
I need to find the users who Don't like all of the shops located in the SAME region in which they live.
If i get the count of shops the user likes in their region, and get the amount of shops in a region, and if the counts aren't the same, am I right in thinking this should work?

I want to create a relationship between nodes that have one or multiple things in common and want to set the count of the common things as a property inside the relationship.
For example: in the movie-tutorial-graph I want to create a relationship between actors that have acted in the same movie(s) together and the set count of the movies they played in together as a property in the relationship.
For the basic counting, the tutorial provides a query:
MATCH (n)-[:ACTED_IN]->(m)<-[:ACTED_

I have the following data:
gen yr coef ci_l ci_h
F -8 0.0059488 -0.004565 0.0164627
F -7 0.0040078 -0.0057631 0.0137786
F -6 0.0049703 -0.0085357 0.0184763
F -5 -0.0019084 -0.0211634 0.0173466
F -4 0.0013469 -0.0215072 0.0242009
F -3 0.036477 0.017118 0.0558361
F -2 0.1271414 0.089147 0.1651358
F -1 0.1431927 0.1021379 0.1842475
F 0 0.1398031 0.1025783 0.177028
F 1 0.1349187 0.0997429 0.1700946
F 2 0.135551

I have a directed weighted simple graph. I want to contract every node that has equal node value with another node that is directly connected to it. After contraction parallel edges would be made into one with the sum of the weights.
What is the most efficient way/algorithm for doing this? My graph is stored as an adjacency list if that would alter the answer.

Let's consider as an example that I have the following adjacence matrix in coordinate format:
> edge_index.numpy() = array([[ 0, 1, 0, 3, 2],
[ 1, 0, 3, 2, 1]], dtype=int64)
which means that the node 0 is linked toward the node 1, and vice-versa, the node 0 is linked to 3 etc...
Do you know a way to draw this graph as in networkx with nx.draw() ?
Thank you.

I've been learning about ssa (static single assignment form), and I was given the following graph with phi functions inserted, but the graph hasn't been renamed:
I had to rename the variables, and this is what I got:
I am very unsure that this is correct. Did I rename the variables correctly? Is this minimal ssa? I am using this algorithm from here (Cytron, et. al's paper) to rename the variables. Please help! :)

I have a data set with the following variables: student ID, OS, RAM, browser, Step1, Step2, Step3, Step4, Step5, Step6, Step7, etc. The step variables contain numeric values representing times, while the other variables are categorical. I've already used proc means to produce tables showing the mean values for each step both overall and when broken down by various categories. The code looks like this:
proc means data=times;
var step1 step2 step3 step4 step5 step6 step7;
output out=means

Tags： Graph
Uml
plantumlcomponent-diagram
I'm trying to plot this component diagram with plantuml
@startuml
skinparam linetype ortho
left to right direction
folder BASE {
folder foo {
component aaa
}
folder bar {
component bbb
folder ENV {
artifact ccc <<config>>
artifact ddd <<db>>
}
}
}
folder lorem {
folder ipsum {
component eee
component fff
component ggg
}
folder amet {
component panel &

I'm loading RDF data into a JUNG graph to do some analysis.
So I create a new graph with:
DirectedGraph g = new DirectedSparseGraph<String,GraphLink>();
I created a support class for specifying the link:
public class GraphLink {
String uri;
Float weight;
}
Then I populate it like this:
for each rdf triple <s,p,o>{
g.addVertex( s )
g.addVertex( o )
GraphLink link = new GraphLink()
link.uri = pred
link.weight = some weight;
g.addEdge( link, s, o )
}
Is this an

I have a graph like this:
One simple rule:
Every node in the graph only knows about its successor.
As you can see, the problem occurs when we came to 6 (by the first branch, 1 → 6), so that we do not know when it is time to stop and start traversing another branch (2 → 6).
Could anyone suggest an algorithm for traversing graph like this, please?
I came up with the idea when I am traversing 1 → 6 → end of graph, and then returning to 2 → 6.
But I think this is not good idea, because there c

Tags： Graph
distributedmpi
Do you happen to know any robust, well-recongnised software library which implements distributed graphs using MPI?
What I mean by distributed graph is a graph whose edges and vertices can be distributed over a cluster of processors in an abstract manner.
I need a good example to learn from.
Thank you very much.

Tags： Graph
treedb4oobject-oriented-databasedata-persistence
I have several graphs. The breadth and depth of each graph can vary and will undergo changes and alterations during runtime. See example graph.
There is a root node to get a hold on the whole graph (i.e. tree). A node can have several children and each child serves a special purpose. Furthermore a node can access all its direct children in order to retrieve certain informations. On the other hand a child node may not be aware of its own parent node, nor other siblings. Nothing spectacular so

I'm newbie to Neo4j/GraphDB and have created following simple graph
node[1]user1 which is 'friend' with node[2]user2 and node[3]user3
and all 3 above user have 'post' nodes connected to them as well..
question is how to get user1's connected friend and their post as well?
following query returns friends of user1 and his post only...
START user1=node(2) MATCH user1-->all_node RETURN all_node

Tags： Graph
graphvizdotgraph-visualization
I am a newbie to graphviz and the DOT language. I was trying out generating graphs with cluster subgprahs. However, when I have clusters, each with node positions exactly specified in the script, graphviz does not generate the outline boxes or the labels for the clusters!
Specifically, if I have the following DOT script:
digraph G{
subgraph cluster0{
label="Cluster 0"
a->b
}
subgraph cluster1{
label="Cluster 1"
c->d
}
}
then the graph generated is:
However, with the following DOT scri

How can one compute or quantify the hierarchical nature of a given graph, if there is a hierarchy in that graph ?
More specifically, i want to know if some sort of hierarchy existed in artificial neural network (with some number of hidden layers). and also want to measure that.

Tags： Graph
jgraphmxgraphjgraphx
I saw that is possible to use guidelines in the javascript version of mxGraph and I would like to know if has some way to do the same in the Java version?

I am learning Dijkstra's algorithm and had a basic query. I have a graph that looks as follows..(non-negative nodes):
A---2-----B------16------D-----3-------F
* *
* *
3 4
* *
C----------2---------------------------E
Not clear from above graph display, but AC has a distance of 3 and EF has a distance of 4.
I am interested in finding shortest path

Say I have a tree of nodes that looks like this:
Where the numbers correspond to some value I generally want to sort by. (It could be time, it could be some kind of score, whatever.)
If I return them sorted by just that number, I'd of course get this sort:
1, 2, 3, 4, 5, 6, 7, 8, 9
That's generally fine, but in addition to this sort, I want to apply the constraint that parents always sort before their children. So what I really want is this sort:
3, 2, 1, 4, 5, 6, 7, 8, 9
You can see t

I get this weird exception and I think that it is a bug. I am trying to clear a Series, which contains a list of points to plot in the graph. However, after clearing I want to add new Data and this gives me a nul pointer exception. My code:
public static void main(String[] args) {
Series<String, Number> series = new Series<String, Number>();
Number value1 = new Integer(5);
Number value2 = new Integer(6);
Data<String, Number> point1 = new Data<

Tags： Graph
editorfunction-callcall-graphsource-insight
What I mean by cumulative is that the graph should list the functions that call function x and also all the functions called by function x.
Today in the call graph feature of source insight, in a given view you can get either one of those relations in the "Relationship Window".
You can select if you want to do "Function calls" or "Referenced by functions" by selecting the appropriate drop down in the relationship window properties, but is there a way to do both ? So that I can see the complet

I'm looking at building an image database which consists of nodes with a UUID field and other image properties such as EXIF data. I'll always search for image nodes via the UUID field which will have an index.
MATCH (img:Image {id: "ea191df3-f5e5-4a29-ae93-f850866f90d1"}) RETURN img;
Are there any performance disadvantages to doing this in Neo4j?

Tags： Graph
igraphisomorphism
Given two graph, how can I find the subgraphs in these two graphs that are isomorphic. Currently, I just find igraph has implemented igraph_subisomorphic_vf2, which has two graphs G and H as input and determines whether G contains a subgraph that is isomorphic to H.
Since I haven't found any other function in igraph that can directly solve my problem, I currently think that one way is to enumerate all possible subgraph from a given graph and then use the function igraph_subisomorphic_vf2 to de

we are trying to switch to "3.0 style" of graph functions.
We run the example of the documentation:
FOR v, e IN OUTBOUND SHORTEST_PATH 'circles/A' TO 'circles/D' GRAPH 'traversalGraph' RETURN [v._key, e._key]
and it works on ArangoDB 3.0, but it doesn't in ArangoDB 2.8.11
The error is:
"errorNum":1501,"errorMessage":"syntax error, unexpected quoted string near '' TO 'circles/D' GRAPH 'traversa...' at position 1:46 (while parsing)"
Our goal is switch all queries into "3.0 style", because

Tags： Graph
treegraph-theorygraph-algorithmsubgraph
I am trying to solve the problem below. It is like k-minimum-spanning-tree and the steiner tree problem, but it is with a graph.
We have a non-negative undirected weighted graph G = (V, E).
For every pair of vertices v1 and v2 there exists an edge e12. In other words, every vertex is connected to every other vertex.
We shall create a subset of the vertices U that contains k vertices.
Our goal is to select the n vertices in U such that the sum of the edges from each vertex in U to every other

I've read a white paper claiming that Neo4j has a 65K limit on the number of Relationship Types. Can anyone elaborate on that please?
We're planning to run Neo4j on a Cluster of 18 Nodes (in a distributed manner). Our data is huge (80 billion rows). What's the limit for the number of nodes (entities) or relationships that we can save on a single cluster node? Is there a similar 65K limit for the size of the data per cluster node?

Tags： Graph
alertgrafanagrafana-templatinggrafana-alerts
I have set alerts for Disk usage and now I want set alerts for Memory usage but I am not able to set it is giving error FAILED TO TEST RULE. Axes B is used and Axes C is Total.

Tags： Graph
frontenddata-visualizationdata-analysisinfluxdb
I have a time series database for which I have to build a front-end. The front-end needs to contain some panels and graph on the basis of the data provided to it from database. Can anyone suggest me a tool which I can use to build the front-end and then connect with the database (InfluxDB)?

What is the basic 'unit of storage' for the neo4j database engine? For example, for a relational database, it might be seen of as a row of data. What is the equivalent atomic unit in a graph database? Is it a connection, and if so, what type of 'metadata' is there attached to it? For example:
connection: (A,B) # tuple
is_directed: false
_meta: # helper data for the user to know what the edge "AB" is
What if someone wanted to define "A" as an object?

I have the following graph:
(Boxer)-[:STARTS]->(Round)-[:CONTINUES]->(Round)-[:CONTINUES]->(Round)-[:CONTINUES]->(Round)
I want to insert a new Round AFTER a specified Round called prevRound. Right now I am doing this:
MERGE (round:Round {uuid: $round.uuid})
MERGE (prevRound:Round {uuid: $prevRound.uuid})
MERGE (prevRound)-[oldRel:CONTINUES]->(nextRound)
MERGE (prevRound)-[:CONTINUES]->(round)-[:CONTINUES]->(nextRound)
DELETE oldRel
This works but it will actually crea

Tags： Graph
sharepoint-online
I have created an unlicenced user in my office 365 tenant, and this user is part of one of the Office 365 groups.
Now when I login with this User in my sharepoint site, I need to check if the user is part of any Office 365 group. This check is done in one of the SPFx webpart, where I have given the permission as below:
"webApiPermissionRequests": [
{
"resource": "Microsoft Graph",
"scope": "Directory.Read.All"
}
]
All the required AP

When we pass input as node features (x) and edge index (edge_index) to pytorch_geometric layer (e.g. GATConv), I am worried whether the layer can differentiate which batch sample the given node elements belong to.
x follows the shape [num of nodes, feature size] and edge_index follows shape [2, num of edges]. However, these 2 do not have the given information to know which input graph of batch size 32 have given node feature in the x.
Anyone can clarify on this ?

1 2 3 4 5 6 ...

下一页 最后一页 共 17 页