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.

Best algorithm for detecting cycles in a directed graph

What is the most efficient algorithm for detecting all cycles within a directed graph? I have a directed graph representing …

algorithm graph-theory directed-graph
how to draw directed graphs using networkx in python?

I have some nodes coming from a script that I want to map on to a graph. In the below, …

python plot graph networkx directed-graph
GraphViz - How to connect subgraphs?

In the DOT language for GraphViz, I'm trying to represent a dependency diagram. I need to be able to have …

graphics graphviz dot directed-graph subgraph
How do I check if a directed graph is acyclic?

How do I check if a directed graph is acyclic? And how is the algorithm called? I would appreciate a …

algorithm theory directed-graph directed-acyclic-graphs
Algorithm to check if directed graph is strongly connected

I need to check if a directed graph is strongly connected, or, in other words, if all nodes can be …

algorithm directed-graph strongly-connected-graph
How To Use Jackson's @JsonIdentityInfo for Deserialization of directed Graphs?

I want to use Jackson 2.3.3 for Deserialization/Serialization of directed graphs. The structure I came up with is roughly the …

java json serialization jackson directed-graph
Plotting the degree distribution of a graph using nx.degree_histogram

I've tried to use the following code to plot the degree distribution of the networkx.DiGraph G: def plot_degree_…

python matplotlib histogram networkx directed-graph
What is the most efficient way to determine if a directed graph is singly connected?

I am working on an assignment where one of the problems asks to derive an algorithm to check if a …

algorithm adjacency-list directed-graph
Getting the root (head) of a DiGraph in networkx (Python)

I'm trying to use networkx to do some graph representation in a project, and I'm not sure how to do …

python networkx directed-graph
How to remove cycles in an unweighted directed graph, such that the number of edges is maximised?

Let G be an unweighted directed graph containing cycles. I'm looking for an algorithm which finds/creates all acyclic graphs …

algorithm graph graph-theory directed-graph cyclic