Top "Directed-graph" questions

A directed graph is graph, i.e., a set of objects (called vertices or nodes) that are connected together, where all the edges are directed from one vertex to another.

d3 - "Cannot create property 'vx' on number '65'"

So I'm trying to purpose this great example Force-Directed Graph for some very simple json: https://raw.githubusercontent.com/DealPete/…

json d3.js directed-graph d3-force-directed
Finding Successors of Successors in a Directed Graph in NetworkX

I'm working on some code for a directed graph in NetworkX, and have hit a block that's likely the result …

python networkx directed-graph
What options are available for the layout of directed or undirected graphs in .NET?

By graph here I mean something resembling these images: The ideal solution would: use only managed code allow output to …

.net rendering graph-theory directed-graph graph-layout
Are Trees Directed or Undirected Graphs?

I have read that Trees are special cases of Graphs. Graphs can be directed or undirected. but if we consider …

data-structures graph tree directed-graph
Graph incidence list implementation

I'm considering graph data structure implementations and am looking at the "incidence list" representation. There is a brief description of …

java graph directed-graph
Data structure for directed graphs, allowing fast node deletion?

I need to store a directed graph (not necessarily acyclic), so that node deletion is as fast as possible. I …

algorithm graph directed-graph
Finding all cycles in a directed graph using recursive backtracking

I am working on finding cycles in directed graph using recursive backtracking. There is a suggested pseudocode for this here, …

java algorithm recursion directed-graph cyclic
Finding separate graphs within a graph object in networkx

I have an enormous graph dataset - let's say it is like this, but on a much bigger level: 1 -&…

python networkx directed-acyclic-graphs directed-graph
Tarjan's strongly connected components algorithm in python not working

I implemented the Tarjan's strongly connected components algorithm, according to wikipedia, in Python, but it isn't working. The algorithm is …

python algorithm directed-graph tarjans-algorithm
How to count all reachable nodes in a directed graph?

There is a directed graph (which might contain cycles), and each node has a value on it, how could we …

algorithm graph directed-graph