Questions tagged [digraphs]

A 'digraph' means 'one symbol written as two characters'. In printing it meant two letters cast as one piece of lead, e.g. ae, fi, ...

In graph theory, 'digraph' is an abbreviation of 'directed graph'. You may want to use the more explicit tag directed-graph.

In computer programming, digraphs and trigraphs are sequences of two and three characters respectively, appearing in source code, which a programming language specification requires an implementation of that language to treat as if they were one other character.

Various reasons exist for using digraphs and trigraphs: keyboards may not have keys to cover the entire character set of the language, input of special characters may be difficult, text editors may reserve some characters for special use and so on. Trigraphs might also be used for some EBCDIC code pages that lack characters such as { and }.

155 questions
-1
votes
1 answer

Finding girth using BFS for a Digraph

So I am having some trouble finding the girth for the following Digraph. I am required to use BFS to find the girth, but I am lost in how to find it. Any help in this regard would be highly appreciated. Thank You.
-1
votes
1 answer

How to access nodes edges of dot format graph (Generalised ) in haskell

I want to access the nodes, edges and properties of 'xDotGraph' (G.DotGraph) and set those again. Here is Haskell code that prints dot format graph using graphviz: $ cat example.dot digraph { a [type1="", type2=""]; b [type1="",…
David
  • 63
  • 1
  • 10
-1
votes
1 answer

Error when using predecessorListOf in jgrapht

I created a digraph using the jgrapht libray, added some vertices and edges. I can't manage to make the predecessorListOf method work in my program. I made a very simple one to try to find the issue but same problem, it says that the function…
Graham Slick
  • 6,692
  • 9
  • 51
  • 87
-2
votes
1 answer

Find n-length cycles in python

I'm new to Python, and have spent a while without programming so would very much appreciate your help. I have to look for all n-length cycles in a given data-structure -I'm currently using lists but maybe a dict would do the work- Each element in…
jtppeamc
  • 7
  • 2
-3
votes
1 answer

Dijkstra's Shortest Path with Strongly Connected Graphs

Assuming I have a working dijkstra's shortest path method, how can I use this to determine whether or not a directed graph is strongly connected or not?
1 2 3
10
11