graph-traversal Questions
1
I have a problem with graph traversal. My use case is not solvable using typical graph traversal algorithms (DFS, BFS). I want traverse nodes, starting from specific Node (N), where edge is of type...
Photon asked 7/9, 2017 at 9:39
3
Solved
Is it accurate to say that of the existing graph query languages (Cypher, Datalog, Sparql etc) Gremlin is the only one that's Turing complete?
In case it matters, I'm not looking for edge cases li...
Raines asked 18/12, 2015 at 4:48
2
Solved
I quote from Artificial Intelligence: A Modern Approach:
The properties of depth-first search depend strongly on whether the graph-search or tree-search version is used. The graph-search version...
Sclerodermatous asked 12/2, 2012 at 16:54
8
I'm trying to figure out a neat way of traversing a graph Scala-style, preferably with vals and immutable data types.
Given the following graph,
val graph = Map(0 -> Set(1),
1 -> Set(2),
...
Cristicristian asked 29/3, 2011 at 10:41
1
Solved
I'm trying to find the paths that a user could take through a website. I have represented my graph using this format:
graph = { 0 : [1, 2],
1 : [3, 6, 0],
2 : [4, 5, 0],
3 : [1],
4 : [6, 2],
5...
Bocage asked 30/6, 2020 at 11:31
2
Solved
I want to find 'n' maximum weighted edges in a networkx graph. How can it be achieved. I have constructed a graph as follows :
g_test = nx.from_pandas_edgelist(new_df, 'number', 'contactNumber', e...
Cryosurgery asked 21/9, 2018 at 9:19
1
I have a problem in which I need to perform CRUD operations on cyclic graphs. Now I know that there are a bunch of graph databases out there, but I have a specific set of use cases which are not su...
Vondavonni asked 18/7, 2018 at 10:53
2
Solved
What is the easiest way to get the predecessors of a BasicBlock in the LLVM framework?
I have taken a look at DepthFirstIterator and idf_iterator<BasicBlock*>, but I actually need to do a br...
Loriloria asked 11/2, 2014 at 17:1
0
I am doing some research on how to translate user's input in plain English into Graph Traversal Language, especially Gremlin. However, I cannot find any research papers or source code related with ...
Leash asked 12/2, 2018 at 15:25
2
Solved
PyYAML can handle cyclic graphs in regular python objects. For example:
Snippet #1.
class Node: pass
a = Node()
b = Node()
a.child = b
b.child = a
# We now have the cycle a->b->a
serialized...
Disarray asked 7/1, 2015 at 18:53
1
Solved
Imagine there is a graph. The nodes are of the form GraphNode. The graph can have duplicate nodes. We have to do a BFS on the graph. We do not know the entire graph in the beginning, i.e., there is...
Bulla asked 10/9, 2017 at 18:51
2
Solved
I have a graph with three collections which items can be connected by edges.
ItemA is a parent of itemB which in turn is a parent of itemC.
Elements only can be connected by edges in direction
...
Bigelow asked 6/10, 2016 at 13:56
1
In a graph traversal I only want to consider edges that have a property that is equal to the property of one of the edges visited in a previous step in the traversal.
I found http://tinkerpop.apa...
Interne asked 20/10, 2016 at 22:18
1
Solved
I have a simple node-links graph in ArangoDB. How can I traverse from 1 preselected node and return all nodes which are related to it?
For example:
A→B, B→C, C→D, C→E, F→B, F→E
Selecting any of t...
Trix asked 3/8, 2016 at 12:47
2
Solved
This is question about good practice
Consider situation which is typical e.g. in 3D engines, physics engines, Finite element method or classical molecular dynamics solvers: You have objects of var...
Crippling asked 21/4, 2016 at 9:24
1
Solved
Given the directed graph below, how did we achieve the post-order traversal?
DFS
Visiting order in Pre-order traversal: 1 2 5 4 6 3
Visiting order in Post-order traversal: 4 6 5 2 1 3
Ruffianism asked 7/4, 2016 at 23:28
3
I'm trying to programmatically calculate voltage changes over a very large circuit.
*This question may seem geared toward electronics, but it's
more about applying an algorithm over a set of d...
Dele asked 3/6, 2015 at 7:17
1
Solved
I'm currently trying Neo4J Koan Tutorial. I'm getting really confused at Koan06 where Traversal are introduced. Method Node.traversal is deprecated in favour for Traversal.traverse. As I tried it, ...
Frisbee asked 22/1, 2014 at 16:36
1
EDIT 3:
Okay, so i got my code to work, but i'm facing a huge memory consumption problem if i'm using let's say 16 nodes and a search depth above 11.
an soemone check the code and tell me how can ...
Bonne asked 24/7, 2013 at 13:33
1
Solved
Apache Giraph vs Neo4j : Are the traversal algorithms across nodes totally different in theses two graph processing systems ? If we were to traverse say a social graph using Giraph and Neo4j on dat...
Obtest asked 4/7, 2013 at 20:18
3
Solved
I currently have a list of connections stored in a list where each connection is a directed link that connects two points and no point ever links to more than one point or is linked to by more than...
Lamelli asked 7/5, 2013 at 0:45
3
I was wondering if there is an algorithm which:
given a fully connected graph of n-nodes (with different weights)... will give me the cheapest cycle to go from node A (a start node) to all other no...
Bottom asked 4/8, 2011 at 15:53
3
Solved
I'm looking for a method to create a list of or detect keyboard runs in a password.
I can bound my problem with password criteria such as length and number of special characters required.
An exam...
Vitiligo asked 12/7, 2011 at 22:22
4
Solved
I know the title is a bit messy, but I don't know how to explain it better.
What I'm trying to do:
Using a graph found in a text file, find and print the shortest path (minimum amount of vertices...
Manciple asked 28/3, 2011 at 18:39
3
Solved
This is possibly a problem with possibly no optimal solution. Suppose I have a directed graph, have no clue whether it has any cycles or not(cycle detection will be one of the aspects of this probl...
Denary asked 9/3, 2011 at 17:38
1 Next >
© 2022 - 2024 — McMap. All rights reserved.