<Chapter Label="Creating digraphs"><Heading>Creating digraphs</Heading>

  In this chapter we describe how to create digraphs.<P/>

  <Section><Heading>Creating digraphs</Heading>
    <#Include Label="IsDigraph">
    <#Include Label="IsCayleyDigraph">
    <#Include Label="IsDigraphWithAdjacencyFunction">
    <#Include Label="DigraphType">
    <#Include Label="Digraph">
    <#Include Label="DigraphByAdjacencyMatrix">
    <#Include Label="DigraphByEdges">
    <#Include Label="EdgeOrbitsDigraph">
    <#Include Label="DigraphByInNeighbours">
    <#Include Label="CayleyDigraph">
  </Section>

  <Section><Heading>Changing representations</Heading>
    <#Include Label="AsBinaryRelation">
    <#Include Label="AsDigraph">
    <#Include Label="Graph">
    <#Include Label="AsGraph">
    <#Include Label="AsTransformation">
  </Section>

  <Section><Heading>New digraphs from old</Heading>
    <#Include Label="DigraphCopy">
    <#Include Label="InducedSubdigraph">
    <#Include Label="ReducedDigraph">
    <#Include Label="MaximalSymmetricSubdigraph">
    <#Include Label="MaximalAntiSymmetricSubdigraph">
    <#Include Label="UndirectedSpanningTree">
    <#Include Label="QuotientDigraph">
    <#Include Label="DigraphReverse">
    <#Include Label="DigraphDual">
    <#Include Label="DigraphSymmetricClosure">
    <#Include Label="DigraphReflexiveTransitiveClosure">
    <#Include Label="DigraphReflexiveTransitiveReduction">
    <#Include Label="DigraphAddVertex">
    <#Include Label="DigraphAddVertices">
    <#Include Label="DigraphAddEdge">
    <#Include Label="DigraphAddEdgeOrbit">
    <#Include Label="DigraphAddEdges">
    <#Include Label="DigraphRemoveVertex">
    <#Include Label="DigraphRemoveVertices">
    <#Include Label="DigraphRemoveEdge">
    <#Include Label="DigraphRemoveEdgeOrbit">
    <#Include Label="DigraphRemoveEdges">
    <#Include Label="DigraphRemoveLoops">
    <#Include Label="DigraphRemoveAllMultipleEdges">
    <#Include Label="DigraphReverseEdges">
    <#Include Label="DigraphDisjointUnion">
    <#Include Label="DigraphEdgeUnion">
    <#Include Label="DigraphJoin">
    <#Include Label="LineDigraph">
    <#Include Label="LineUndirectedDigraph">
    <#Include Label="DoubleDigraph">
    <#Include Label="BipartiteDoubleDigraph">
    <#Include Label="DigraphAddAllLoops">
    <#Include Label="DistanceDigraph">
    <#Include Label="DigraphClosure">
  </Section>

  <Section><Heading>Random digraphs</Heading>
    <#Include Label="RandomDigraph">
    <#Include Label="RandomMultiDigraph">
    <#Include Label="RandomTournament">
  </Section>

  <Section><Heading>Standard examples</Heading>
    <#Include Label="ChainDigraph">
    <#Include Label="CompleteDigraph">
    <#Include Label="CompleteBipartiteDigraph">
    <#Include Label="CompleteMultipartiteDigraph">
    <#Include Label="CycleDigraph">
    <#Include Label="EmptyDigraph">
    <#Include Label="JohnsonDigraph">
  </Section>

</Chapter>
