nonneighbors(MixedGraph,Thing) -- return the neighbors of a vertex of a mixed graph

Synopsis

• Function: nonneighbors

• Usage:

  nonneighbors (G,v)

  nonneighbors (G,v)

• Inputs:
  • G, an instance of the type MixedGraph,
  • v, a thing, a vertex of G
• Outputs:
  • a set,

Description

i1 : G = mixedGraph(graph{{3,1}},digraph {{1,2},{2,3}},bigraph {{3,4},{2,4}})

o1 = MixedGraph{Bigraph => Bigraph{2 => {4}   }}
                                   3 => {4}
                                   4 => {3, 2}
                Digraph => Digraph{1 => {2}}
                                   2 => {3}
                                   3 => {}
                Graph => Graph{1 => {3}}
                               3 => {1}

o1 : MixedGraph

i2 : nonneighbors (G,1)

o2 = set {4, 2}

o2 : Set

i3 : nonneighbors (G,2)

o3 = set {4, 1, 3}

o3 : Set

See also

• MixedGraph -- a graph that has undirected, directed and bidirected edges
• nonneighbors -- returns the non-neighbors of a vertex in a graph
• neighbors -- returns the neighbors of a vertex in a graph
• neighbors(MixedGraph,Thing) -- return the neighbors of a vertex of a mixed graph