Ziele Untersuchung
mit Columbo Integrität von
Datenbanken Interaktion und
Portierbarkeit Ergonomie der
Schnittstellen

Angebot Produkte Projekt Beratung

Mittel Analytik Modellierung Sprachen Algebra Logik Hardware Denken Kreativität

Zusammenhänge Gesellschaft Wirtschaft Branche Firma


products/sources/formale Sprachen/GAP/pkg/digraphs/doc/ (Algebra von RWTH Aachen Version 4.15.1^©) Datei vom 27.8.2025 mit Größe 4 kB

Quelle z-chap4.xml Sprache: XML

<Chapter Label="Attributes and operations"><Heading>Attributes and operations</Heading>
  <Section><Heading>Vertices and edges</Heading>
    <#Include Label="DigraphVertices">
    <#Include Label="DigraphNrVertices">
    <#Include Label="DigraphEdges">
    <#Include Label="DigraphNrEdges">
    <#Include Label="DigraphNrAdjacencies">
    <#Include Label="DigraphNrAdjacenciesWithoutLoops">
    <#Include Label="DigraphNrLoops">
    <#Include Label="DigraphSinks">
    <#Include Label="DigraphSources">
    <#Include Label="DigraphTopologicalSort">
    <#Include Label="DigraphVertexLabel">
    <#Include Label="DigraphVertexLabels">
    <#Include Label="DigraphEdgeLabel">
    <#Include Label="DigraphEdgeLabels">
    <#Include Label="DigraphInEdges">
    <#Include Label="DigraphOutEdges">
    <#Include Label="IsDigraphEdge">
    <#Include Label="IsMatching">
    <#Include Label="DigraphMaximalMatching">
    <#Include Label="DigraphMaximumMatching">
  </Section>

  <Section><Heading>Neighbours and degree</Heading>
    <#Include Label="AdjacencyMatrix">
    <#Include Label="CharacteristicPolynomial">
    <#Include Label="BooleanAdjacencyMatrix">
    <#Include Label="DigraphAdjacencyFunction">
    <#Include Label="RangeSourceDigraph">
    <#Include Label="OutNeighbours">
    <#Include Label="InNeighbours">
    <#Include Label="OutDegrees">
    <#Include Label="InDegrees">
    <#Include Label="OutDegreeOfVertex">
    <#Include Label="OutNeighboursOfVertex">
    <#Include Label="InDegreeOfVertex">
    <#Include Label="InNeighboursOfVertex">
    <#Include Label="DigraphLoops">
    <#Include Label="DegreeMatrix">
    <#Include Label="LaplacianMatrix">
  </Section>

  <Section><Heading>Orders</Heading>
    <#Include Label="PartialOrderDigraphMeetOfVertices">
    <#Include Label="NonUpperSemimodularPair">
  </Section>

  <Section><Heading>Reachability and connectivity</Heading>
    <#Include Label="DigraphDiameter">
    <#Include Label="DigraphShortestDistance">
    <#Include Label="DigraphShortestDistances">
    <#Include Label="DigraphLongestDistanceFromVertex">
    <#Include Label="DigraphDistanceSet">
    <#Include Label="DigraphGirth">
    <#Include Label="DigraphOddGirth">
    <#Include Label="DigraphUndirectedGirth">
    <#Include Label="DigraphConnectedComponents">
    <#Include Label="DigraphConnectedComponent">
    <#Include Label="DigraphStronglyConnectedComponents">
    <#Include Label="DigraphStronglyConnectedComponent">
    <#Include Label="DigraphBicomponents">
    <#Include Label="ArticulationPoints">
    <#Include Label="MinimalCyclicEdgeCut">
    <#Include Label="Bridges">
    <#Include Label="StrongOrientation">
    <#Include Label="DigraphPeriod">
    <#Include Label="DigraphFloydWarshall">
    <#Include Label="IsReachable">
    <#Include Label="IsDigraphPath">
    <#Include Label="VerticesReachableFrom">
    <#Include Label="DigraphPath">
    <#Include Label="DigraphShortestPath">
    <#Include Label="DigraphRandomWalk">
    <#Include Label="DigraphAbsorptionProbabilities">
    <#Include Label="DigraphAbsorptionExpectedSteps">
    <#Include Label="Dominators">
    <#Include Label="DominatorTree">
    <#Include Label="IteratorOfPaths">
    <#Include Label="DigraphAllSimpleCircuits">
    <#Include Label="DigraphLongestSimpleCircuit">
    <#Include Label="DigraphAllUndirectedSimpleCircuits">
    <#Include Label="DigraphAllChordlessCycles">
    <#Include Label="FacialWalks">
    <#Include Label="DigraphLayers">
    <#Include Label="DigraphDegeneracy">
    <#Include Label="DigraphDegeneracyOrdering">
    <#Include Label="HamiltonianPath">
    <#Include Label="NrSpanningTrees">
    <#Include Label="DigraphDijkstra">
    <#Include Label="DigraphCycleBasis">
    <#Include Label="DigraphIsKing">
    <#Include Label="DigraphKings">
  </Section>

  <Section><Heading>Cayley graphs of groups</Heading>
    <#Include Label="GroupOfCayleyDigraph">
    <#Include Label="GeneratorsOfCayleyDigraph">
  </Section>

  <Section><Heading>Associated semigroups</Heading>
    <#Include Label="AsSemigroupDigraph">
    <#Include Label="AsCliffordSemigroup">
  </Section>

  <Section><Heading>Planarity</Heading>
    <#Include Label="KuratowskiPlanarSubdigraph">
    <#Include Label="KuratowskiOuterPlanarSubdigraph">
    <#Include Label="PlanarEmbedding">
    <#Include Label="OuterPlanarEmbedding">
    <#Include Label="SubdigraphHomeomorphicToK">
    <#Include Label="DualPlanarGraph">
  </Section>

  <Section><Heading>Hashing</Heading>
    <#Include Label="DigraphHash">
  </Section>

</Chapter>

quality93%

¤ Dauer der Verarbeitung: 0.15 Sekunden (vorverarbeitet) ¤

Wurzel

Suchen

Beweissystem der NASA

Beweissystem Isabelle

NIST Cobol Testsuite

Cephes Mathematical Library

Wiener Entwicklungsmethode

Haftungshinweis

Die Informationen auf dieser Webseite wurden nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit, noch Qualität der bereit gestellten Informationen zugesichert.