directed-graph Questions
7
Solved
I'm trying to work out an algorithm for finding a path across a directed graph. It's not a conventional path and I can't find any references to anything like this being done already.
I want to fin...
Virilism asked 16/5, 2009 at 19:35
1
Solved
I am working on finding cycles in directed graph using recursive backtracking. There is a suggested pseudocode for this here, which is here:
dfs(adj,node,visited):
if (visited[node]):
if (node...
Hautegaronne asked 13/12, 2013 at 21:51
3
Solved
I came across this SO post where it is suggested that cycle detection using DFS in a directed graph is faster because of backtracking. Here I quote from that link:
Depth first search is more mem...
Mackintosh asked 12/12, 2013 at 22:10
1
Solved
Is there any documentation (full pseudo code?) on the algorithm from dot within the Graphviz Library?
I only found some partial pseudo code documentation.
Cockalorum asked 8/10, 2013 at 10:34
2
Solved
I need to find an algorithm for finding all the roots in a directed graph, in O(n+m).
I have an algorithm for finding a single root:
Run DFS(v) on some v in V. If the result is a single spanning...
Gezira asked 13/11, 2013 at 9:40
14
By graph here I mean something resembling these images:
The ideal solution would:
use only managed code
allow output to a bitmap image
allow output to WPF elements
include some kind of inter...
Amygdaloid asked 26/2, 2009 at 10:4
4
I've some lists with variable number of elements. Each list is sorted, but the sorting algorithm is not known. I would like to merge the lists into one big list which contains all lists in same ord...
Quasar asked 10/1, 2011 at 10:37
5
Solved
I'm looking for a way to draw directed graphs in PHP. (as in http://upload.wikimedia.org/wikipedia/commons/0/08/Directed_acyclic_graph.png). I want it to create an image of the graph just like GD c...
Asymptomatic asked 11/5, 2009 at 20:50
3
I am interested in persisting individual directed graphs. This question is not asking for a full-scale graph database solution, but for a document format that I can use to save and individual arbit...
Piliferous asked 3/5, 2013 at 17:11
2
Solved
for my thesis I need to draw some probabilistic control flow graphs. i.e. control flow graphs with probabilities depicted on the edges.
I found graph-tool which seems quite useful, since it can us...
Obedient asked 20/12, 2012 at 14:45
8
Solved
Is there an already implemented data structure that I can use in order to assign to an object
(in my case an Edge), an integer? I am reading a graph from a file , 10 mil vertices , 60 mil edges and...
Sohn asked 31/10, 2012 at 9:12
1
I'm looking for a mathematical formalism for a data structure I'm working with, so that I can track down relevant theorems and algorithms.
Suppose you have the following:
A directed acyclic grap...
Psilomelane asked 1/4, 2012 at 14:37
6
We are given a graph with the following facts:
edge(a,b)
edge(a,c)
edge(b,a)
edge(c,d)
edge(d,d)
edge(d,e)
edge(e,f)
edge(f,g)
edge(g,e)
And we are asked to define a rule, cycle(X), that determi...
Stacistacia asked 17/7, 2011 at 0:21
2
Solved
Some programming languages (like haskell) allow cyclic dependencies between modules. Since the compiler needs to know all definitions of all modules imported while compiling one module, it usually ...
Aristaeus asked 15/5, 2012 at 19:54
5
Solved
The (directed) graphs represent finite automata. Up until now my test program has been writing out dot files for testing. This is pretty good both for regression testing (keep the verified output f...
Weidar asked 28/3, 2010 at 20:49
3
Solved
Given a table holding edges in a directed graph like this:
CREATE TABLE edges (
from_here int not null,
to_there int not null
)
What's the nicest way to get the number of distinct undirected...
Ringhals asked 10/3, 2011 at 19:36
3
I need to represent directed graphs in Clojure. I'd like to represent each node in the graph as an object (probably a record) that includes a field called :edges that is a collection of the nodes t...
Junie asked 2/1, 2011 at 22:30
2
I want to use the apparently fantastic GraphSharp library but the project has NO documentation.
Specifically I'm interested in using the layout engine and not interested in the WPF control.
I sim...
Walczak asked 23/6, 2010 at 10:41
2
Solved
I'm currently working on a project that enumerates the k-best solutions of a dynamic program using a directed hypergraph framework. My current implementation (in Python) works well, but is fairly s...
Bolin asked 1/12, 2011 at 21:20
1
Solved
I have to add some interactive features to SVG directed graphs.
So far the graphs I want to show are generated from a dot file and rendered as SVG. I'd like to know if there is some easy way to ad...
Laundryman asked 16/9, 2011 at 21:20
3
Solved
Using the dot directed graph language, is it possible to create subgraphs with a different rankdir?
I tried the following, which didn't work. Both graphs were left to right, despite the presence o...
Illjudged asked 18/6, 2009 at 17:34
1
Solved
Let G be an unweighted directed graph containing cycles. I'm looking for an algorithm which finds/creates all acyclic graphs G', composed of all vertices in G and a subset of edges of G, just small...
Tamayo asked 8/6, 2011 at 19:58
1
Solved
Disclaimer: The author is a newbie in Erlang.
Imagine, we have a graph consisting of 1M nodes, and each node has 0-4 neighbours (the edges are emanating from each node to those neighbours, so the ...
Spleen asked 17/7, 2011 at 16:40
5
I want to embed a flow diagram drawing canvas in my program.
Users would possible to:
draw "nodes" (rectangle nodes is enough) and "edges" (preferable to be orthogonal) to connect
"nodes";
...
Redbird asked 29/5, 2011 at 14:50
2
Solved
This is what the generated graph looks currently:
And here is the code for this:
digraph {
rankdir=TB;
subgraph cluster01 {
label="1.fázis"
aSTART;
node [shape = doublecircle]; a001;
nod...
Filmore asked 23/4, 2011 at 13:30
© 2022 - 2024 — McMap. All rights reserved.