directedGraph -- creating a directed graph

Synopsis

• Usage:

  G = directedGraph(V,E)

• Inputs:

  • V, a list, elements in the vertices of G
  • E, a list, sequences (a,b) which represents a directed edge from a to b
• Outputs:

  • G, an object of class DirectedGraph, a directed graph on vertex set V with directed edges E

Description

i1 : V = {a,b,c,d};

i2 : E = {(a,b), (a,c), (c,d)};

i3 : G = directedGraph (V,E)

o3 = DirectedGraph{cache => CacheTable                      }
                   DirectedEdges => {(a, b), (a, c), (c, d)}
                   Vertices => {a, b, c, d}

o3 : DirectedGraph

See also

• DirectedGraph -- a class for directed graphs
• Vertices -- the set of vertices a directed graph
• DirectedEdges -- the set of directed edges of a directed graph
• adjacencyMatrix -- returns adjacency matrix of a directed graph