Digraphs/doc/z-chap5.xml at b6712a8ebbd2bf4e665957ff78e6d7ed0fa64f24 · digraphs/Digraphs · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
<Chapter Label="Properties of digraphs"><Heading>Properties of digraphs</Heading>

  <Section><Heading>Vertex properties</Heading>
    <#Include Label="DigraphHasAVertex">
    <#Include Label="DigraphHasNoVertices">
  </Section>

  <Section><Heading>Edge properties</Heading>
    <#Include Label="DigraphHasLoops">
    <#Include Label="IsAntisymmetricDigraph">
    <#Include Label="IsBipartiteDigraph">
    <#Include Label="IsCompleteBipartiteDigraph">
    <#Include Label="IsCompleteDigraph">
    <#Include Label="IsCompleteMultipartiteDigraph">
    <#Include Label="IsEmptyDigraph">
    <#Include Label="IsEquivalenceDigraph">
    <#Include Label="IsFunctionalDigraph">
    <#Include Label="IsPermutationDigraph">
    <#Include Label="IsMultiDigraph">
    <#Include Label="IsNonemptyDigraph">
    <#Include Label="IsReflexiveDigraph">
    <#Include Label="IsSymmetricDigraph">
    <#Include Label="IsTournament">
    <#Include Label="IsTransitiveDigraph">
  </Section>

  <Section><Heading>Edge Weights</Heading>
    <#Include Label="EdgeWeights">
    <#Include Label="EdgeWeightedDigraph">
    <#Include Label="EdgeWeightedDigraphTotalWeight">
    <#Include Label="EdgeWeightedDigraphMinimumSpanningTree">
    <#Include Label="EdgeWeightedDigraphShortestPaths">
    <#Include Label="EdgeWeightedDigraphShortestPath">
    <#Include Label="DigraphMaximumFlow">
    <#Include Label="RandomUniqueEdgeWeightedDigraph">
    <#Include Label="DigraphImmutableCopyNoWeights">
  </Section>

  <Section><Heading>Orders</Heading>
    <#Include Label="IsPreorderDigraph">
    <#Include Label="IsPartialOrderDigraph">
    <#Include Label="IsMeetSemilatticeDigraph">
    <#Include Label="DigraphMeetTable">
    <#Include Label="IsOrderIdeal">
    <#Include Label="IsOrderFilter">
    <#Include Label="IsUpperSemimodularDigraph">
    <#Include Label="IsDistributiveLatticeDigraph">
    <#Include Label="IsModularLatticeDigraph">
  </Section>

  <Section><Heading>Regularity</Heading>
    <#Include Label="IsInRegularDigraph">
    <#Include Label="IsOutRegularDigraph">
    <#Include Label="IsRegularDigraph">
    <#Include Label="IsDistanceRegularDigraph">
  </Section>

  <Section><Heading>Connectivity and cycles</Heading>
    <#Include Label="IsAcyclicDigraph">
    <#Include Label="IsChainDigraph">
    <#Include Label="IsConnectedDigraph">
    <#Include Label="IsBiconnectedDigraph">
    <#Include Label="IsBridgelessDigraph">
    <#Include Label="IsStronglyConnectedDigraph">
    <#Include Label="IsAperiodicDigraph">
    <#Include Label="IsDirectedTree">
    <#Include Label="IsUndirectedTree">
    <#Include Label="IsEulerianDigraph">
    <#Include Label="IsHamiltonianDigraph">
    <#Include Label="IsCycleDigraph">
  </Section>

  <Section Label="Planarity"><Heading>Planarity</Heading>
    <#Include Label="IsPlanarDigraph">
    <#Include Label="IsOuterPlanarDigraph">
  </Section>

  <Section><Heading>Homomorphisms and transformations</Heading>
    <#Include Label="IsDigraphCore">
    <#Include Label="IsEdgeTransitive">
    <#Include Label="IsVertexTransitive">
    <#Include Label="Is2EdgeTransitive">
  </Section>


</Chapter>