# nondescendants(MixedGraph,Thing) -- return the nondescendents of a vertex of a mixed graph

## Synopsis

• Function: nondescendants
• Usage:
nondescendents (G,v)
nondescendants (G,v)
• Inputs:
• G, an instance of the type MixedGraph,
• v, , a vertex of G
• Outputs:

## Description

The nondescendant of v are the all the vertices u such that u is not reachable from v in the directed edge set of the MixedGraph G.

 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 : nondescendants (G,1) o2 = set {4} o2 : Set i3 : nondescendants (G,2) o3 = set {1, 4} o3 : Set i4 : nondescendants (G,3) o4 = set {1, 2, 4} o4 : Set