A complete list of all YAGS's functions organized by topic.
AddEdges( G, E )
Returns a new graph obtained from G by adding the list of edges in E. (B.1-1)
Adjacency( G, x )
Returns the list of vertices in G which are adjacent to vertex x. (B.1-4)
AutomorphismGroup( G )
Returns the automorphism group of graph G. A synonym is AutGroupGraph( G ). (B.1-8)
BoxProduct( G, H );
Returns the box product (or Cartesian product) G□H of graphs G and H. (B.2-5)
BoxTimesProduct( G, H )
Returns the boxtimes product (or strong product) G⊠H of graphs G and H. (B.2-6)
Circulant( n, Jumps )
Returns the minimal graph invariant under the cyclic permutation (1 2 ⋯ n) such that the vertex 1 is adjacent to the vertices in Jumps. (B.3-3)
CliqueGraph( G )
CliqueGraph( G, maxNumCli )
Returns the intersection graph of the (maximal) cliques of G; aborts if maxNumCli cliques are found. (B.3-5)
Cliques( G )
Cliques( G, maxNumCli )
Returns the list of (maximal) cliques of G; aborts if maxNumCli cliques are found. (B.3-7)
ComplementGraph( G )
Returns a new graph H such that V(H)=V(G) and xy∈ E(H) <=> xy not\in E(G). (B.3-9)
CompleteGraph( n )
Returns the graph on n vertices having all possible edges present. (B.3-11)
CompleteMultipartiteGraph( n1, n2 [, n3 ...] )
Returns the graph with r≥ 2 parts of orders n1, n2, ... such that each vertex is adjacent exactly to all the vertices in the other parts not containing itself. (B.3-13)
ConnectedComponents( G )
Returns the equivalence partition of V(G) corresponding to the equivalence relation "reachable" in G. (B.3-17)
CycleGraph( n )
Returns the cyclic graph on n vertices. (B.3-23)
Diameter( G )
Returns the maximum among the distances between pairs of vertices of G. (B.4-3)
DiscreteGraph( n )
Returns the graph on n vertices with no edges. (B.4-5)
DisjointUnion( G, H )
Returns the disjoint union of two graphs G and H. (B.4-6)
Distance( G, x, y )
Returns the minimum length of a path connecting x to y in G. (B.4-7)
Draw( G )
Draw( G, Highlighted )
Draws the graph G on a new window with some Highlighted vertices. (B.4-15)
Edges( G )
Returns the list of edges of graph G. (B.5-3)
GraphAttributeStatistics( OrderList, ProbList, Attribute )
Returns statistics for graph attribute Attribute. (B.7-4)
GraphByAdjacencies( AdjList )
Returns a new graph having AdjList as its list of adjacencies. (B.7-6)
GraphByAdjMatrix( Mat )
Returns a new graph created from an adjacency matrix Mat. (B.7-7)
GraphByCompleteCover( Cover )
Returns the minimal graph where the elements of Cover are (the vertex sets of) complete subgraphs. (B.7-8)
GraphByEdges( L )
Returns the minimal graph such that the pairs in L are edges. (B.7-9)
GraphByRelation( V, Rel )
GraphByRelation( n, Rel )
Returns a new graph G where xy ∈ E(G) iff Rel(x,y)=true. (B.7-10)
GraphByWalks( Walk1, Walk2,...)
Returns the minimal graph such that Walk1, Walk2, etc are walks. (B.7-11)
GraphSum( G, L )
Returns the lexicographic sum of a list of graphs L over a graph G. (B.7-15)
InducedSubgraph( G, V )
Returns the subgraph G induced by the vertex set V. (B.9-4)
InNeigh( G, x )
Returns the list of in-neighbors of x in G. (B.9-5)
IntersectionGraph( L )
Returns the graph G where V(G)=L and XY∈ E(G) <=> X∩ Y ≠ ∅. (B.9-7)
IsEdge( G, x, y )
IsEdge( G, [x,y] )
Returns true if [x,y] is an edge of G. (B.9-15)
IsIsomorphicGraph( G, H )
Returns true when G is isomorphic to H and false otherwise. (B.9-16)
Join( G, H )
Returns the disjoint union of G and H with all the possible edges between G and H added. (B.10-2)
LineGraph( G )
Returns the intersection graph of the edges of G. (B.12-1)
Link( G, x )
Returns the subgraph induced in G by the neighbors of x. (B.12-2)
MaxDegree( G )
Returns the maximum degree in graph G. (B.13-1)
MinDegree( G )
Returns the minimum degree in graph G. (B.13-2)
Order( G )
Returns the number of vertices, of graph G. (B.15-3)
PathGraph( n )
Returns the path graph on n vertices. (B.16-5)
QuotientGraph( G, Part )
QuotientGraph( G, L1, L2 )
Returns the quotient graph of graph G given a vertex partition Part, by identifying any two vertices in the same part. (B.17-3)
RandomGraph( n, p )
RandomGraph( n )
Returns a random graph of order n with edge probability p (a rational in [0,1]). (B.18-3)
RemoveEdges( G, E )
Returns a new graph created from graph G by removing the edges in list E. (B.18-7)
SetDefaultGraphCategory( Catgy )
Sets the default graph category to Catgy. (B.19-2)
Size( G )
Returns the number of edges of graph G. (B.19-4)
TimesProduct( G, H )
Returns the times product (or tensor product) G×H of two graphs G and H. (B.20-4)
TrivialGraph
The one vertex graph. (B.20-7)
VertexDegree( G, x )
Returns the degree of vertex x in graph G. (B.22-1)
VertexNames( G )
Returns the list of names of the vertices of G. (B.22-3)
WheelGraph( n )
WheelGraph( n, r )
This is the cone of an n-cycle; when present, r is the radius of the wheel. (B.23-1)
Coordinates( G )
Returns the list of coordinates of the vertices of G if they exist; fail otherwise. (B.3-19)
Draw( G )
Draw( G, Highlighted )
Draws the graph G on a new window with some Highlighted vertices. (B.4-15)
GraphToRaw( FileName, G )
GraphToRaw( FileName, G, Highlighted )
Writes the graph G in raw format to the file FileName. (B.7-16)
GraphUpdateFromRaw( FileName, G )
Updates the coordinates of G from a file FileName in raw format. (B.7-17)
SetCoordinates( G, Coord )
Sets the coordinates of the vertices of G, which are used to draw G by Draw( G ). (B.19-1)
AddEdges( G, E )
Returns a new graph obtained from G by adding the list of edges in E. (B.1-1)
AddVerticesByAdjacencies( G, NewAdjList )
Returns a new graph obtained from G by adding some vertices with adjacencies described by NewAdjList. (B.1-2)
Graph( Rec )
Returns a new graph created from the information in record Rec. (B.7-3)
GraphByAdjacencies( AdjList )
Returns a new graph having AdjList as its list of adjacencies. (B.7-6)
GraphByAdjMatrix( Mat )
Returns a new graph created from an adjacency matrix Mat. (B.7-7)
GraphByCompleteCover( Cover )
Returns the minimal graph where the elements of Cover are (the vertex sets of) complete subgraphs. (B.7-8)
GraphByEdges( L )
Returns the minimal graph such that the pairs in L are edges. (B.7-9)
GraphByRelation( V, Rel )
GraphByRelation( n, Rel )
Returns a new graph G where xy ∈ E(G) iff Rel(x,y)=true. (B.7-10)
GraphByWalks( Walk1, Walk2,...)
Returns the minimal graph such that Walk1, Walk2, etc are walks. (B.7-11)
InducedSubgraph( G, V )
Returns the subgraph of G induced by the vertex set V. (B.9-4)
IntersectionGraph( L )
Returns the graph G where V(G)=L and XY∈ E(G) <=> X∩ Y ≠ ∅. (B.9-7)
RandomGraph( n, p )
RandomGraph( n )
Returns a random graph of order n with edge probability p (a rational in [0,1]). (B.18-3)
RemoveEdges( G, E )
Returns a new graph created from graph G by removing the edges in list E. (B.18-7)
RemoveVertices( G, V )
Returns a new graph created from graph G by removing the vertices in list V. (B.18-8)
AGraph
A 4-cycle with two pendant vertices on consecutive vertices of the cycle. (B.1-6)
AntennaGraph
A HouseGraph with a pendant vertex (antenna) on the roof. (B.1-7)
BullGraph
A triangle with two pendant vertices (horns). (B.2-7)
ChairGraph
A tree with degree sequence 3,2,1,1,1. (B.3-2)
Circulant( n, Jumps )
Returns the minimal graph invariant under the cyclic permutation (1 2 ⋯ n) such that the vertex 1 is adjacent to the vertices in Jumps. (B.3-3)
ClawGraph
The graph on 4 vertices, 3 edges, and maximum degree 3. (B.3-4)
ClockworkGraph( NNFSList )
ClockworkGraph( NNFSList, rank )
ClockworkGraph( NNFSList, Perm )
ClockworkGraph( NNFSList, rank, Perm )
Returns the clockwork graph specified by its parameters. (B.3-8)
CompleteBipartiteGraph( n, m )
Returns the minimal graph such that all the vertices in {1, 2, ..., n} are adjacent to all the vertices in {n+1,n+2,..., n+m}. (B.3-10)
CompleteGraph( n )
Returns the graph on n vertices having all possible edges present. (B.3-11)
CompleteMultipartiteGraph( n1, n2 [, n3 ...] )
Returns the graph with r≥ 2 parts of orders n1, n2, ... such that each vertex is adjacent exactly to all the vertices in the other parts not containing itself. (B.3-13)
Cube
The 1-skeleton of Plato's cube. (B.3-21)
CubeGraph( n )
Returns the underlying graph of the n-hypercube. (B.3-22)
CycleGraph( n )
Returns the cyclic graph on n vertices. (B.3-23)
CylinderGraph( b, h )
Returns a graph on b(h+1) vertices which is a {4,6}-regular triangulation of the cylinder. (B.3-24)
DartGraph
A diamond with a pendant vertex and maximum degree 4. (B.4-1)
DiamondGraph
The graph on 4 vertices and 5 edges. (B.4-4)
DiscreteGraph( n )
Returns the graph on n vertices with no edges. (B.4-5)
Dodecahedron
The 1-skeleton of Plato's Dodecahedron. (B.4-12)
DominoGraph
Two squares glued by an edge. (B.4-14)
FanGraph( n )
Returns the n-Fan: The join of a vertex and a (n+1)-path. (B.6-1)
FishGraph
A square and a triangle glued by a vertex. (B.6-2)
GemGraph
The 3-Fan graph. (B.7-1)
HouseGraph
A 4-Cycle and a triangle glued by an edge. (B.8-2)
Icosahedron
The 1-skeleton of Plato's icosahedron. (B.9-1)
JohnsonGraph( n, r )
Returns a new graph G where V(G) is the set of r-subsets of {1, 2, ..., n}, two of them being adjacent iff their intersection contains exactly r-1 elements. (B.10-1)
KiteGraph
A diamond with a pendant vertex and maximum degree 3. (B.11-1)
OctahedralGraph( n )
Returns the (2n-2)-regular graph on 2n vertices. (B.15-1)
Octahedron
The 1-skeleton of Plato's octahedron. (B.15-2)
ParachuteGraph
Returns the suspension of a 4-path with a pendant vertex attached to the south pole. (B.16-2)
ParapluieGraph
A 3-Fan graph with a 3-path attached to the universal vertex. (B.16-3)
PathGraph( n )
Returns the path graph on n vertices. (B.16-5)
PawGraph
A triangle with a pendant vertex. (B.16-6)
PetersenGraph
The 3-regular graph on 10 vertices having girth 5. (B.16-7)
RandomCirculant( n )
RandomCirculant( n, k )
RandomCirculant( n, p )
Returns a circulant on n vertices with its jumps selected randomly. (B.18-2)
RGraph
A square with two pendant vertices attached to the same vertex of the square. (B.18-9)
SnubDisphenoid
The 1-skeleton of the 84th Johnson solid. (B.19-5)
SpikyGraph( n )
Returns a complete on n vertices, with an additional complete on n vertices glued to each of its (n-1)-dimensional faces. (B.19-8)
SunGraph( n )
Returns a complete graph on n vertices with a zigzagging corona of 2n vertices glued to a n-cycle of the complete graph. (B.19-9)
Tetrahedron
The 1-skeleton of Plato's tetrahedron. (B.20-2)
TorusGraph( n, m )
Returns (the underlying graph of) a triangulation of the torus on nm vertices. (B.20-5)
TreeGraph( arity, depth )
TreeGraph( ArityList )
Returns the tree, the connected cycle-free graph, specified by it parameters. (B.20-6)
TrivialGraph
The one vertex graph. (B.20-7)
WheelGraph( n )
WheelGraph( n, r )
This is the cone of an n-cycle; when present r is the radius of the wheel. (B.23-1)
ConnectedGraphsOfGivenOrder( n )
Returns the list of all connected graphs of order n (up to isomorphism). (B.3-18)
Graph6ToGraph( String )
Returns the graph represented by String which is encoded using Brendan McKay's graph6 format. (B.7-5)
GraphsOfGivenOrder( n )
Returns the list of all graphs of order n (up to isomorphism). (B.7-14)
HararyToMcKay( Spec )
Returns the McKay's index of a Harary's graph specification Spec. (B.8-1)
ImportGraph6( Filename )
Returns the list of graphs represented in Filename which are encoded using Brendan McKay's graph6 format. (B.9-2)
McKayToHarary( index )
Returns the Harary's graph specification of a McKay's index. (B.8-1)
Adjacencies( G )
Returns the list of adjacencies of G: The neighbors of vertex x are listed in position x of that list. (B.1-3)
Adjacency( G, x )
Returns the list of vertices in G which are adjacent to vertex x. (B.1-4)
AdjMatrix( G )
Returns the adjacency matrix of G. (B.1-5)
AutomorphismGroup( G )
Returns the automorphism group of graph G. A synonym is AutGroupGraph( G ). (B.1-8)
BoundaryVertices( G )
Returns the list of vertices of G that have links isomorphic to a path. But it returns fail if G is not (the underlying graph of a triangulation of) a compact surface. (B.2-4)
ConnectedComponents( G )
Returns the equivalence partition of V(G) corresponding to the equivalence relation "reachable" in G. (B.3-17)
Diameter( G )
Returns the maximum among the distances between pairs of vertices of G. (B.4-3)
Distance( G, x, y )
Returns the minimum length of a path connecting x to y in G. (B.4-7)
DistanceMatrix( G )
Returns an n× n matrix D, where D[x][y] is the distance between x and y in G. (B.4-10)
Distances( G, A, B )
Returns the list of distances between pairs of vertices in A× B. (B.4-8)
DistanceSet( G, A, B )
Returns the set of distances between pairs of vertices in A× B. (B.4-11)
DominatedVertices( G )
Returns the set of dominated vertices of G. (B.4-13)
Eccentricity( G, x )
Returns the distance from a vertex x in graph G to its most distant vertex in G. (B.5-2)
Edges( G )
Returns the list of edges of graph G. (B.5-3)
Girth( G )
Returns the length of a minimum induced cycle in G. (B.7-2)
GraphAttributeStatistics( OrderList, ProbList, Attribute )
Returns statistics for graph attribute Attribute. (B.7-4)
InteriorVertices( G )
Returns the list of vertices of G that have links isomorphic to a cycle. But it returns fail if G is not a compact surface. (B.9-6)
IsCompactSurface( G )
Returns true if every link of G is either an n-cycle, for n≥ 4 or an m-path, for m≥ 2; it returns false otherwise. (B.9-11)
IsDiamondFree( G )
Returns true if G is free from induced diamonds, false otherwise. (B.9-14)
IsEdge( G, x, y )
IsEdge( G, [x,y] )
Returns true if [x,y] is an edge of G. (B.9-15)
IsLocallyConstant( G )
Returns true if all the links of G are isomorphic to each other; false otherwise (B.9-17)
IsLocallyH( G, H )
Returns true if all the links of G are isomorphic to H; false otherwise. (B.9-18)
IsLoopless( G )
Returns true when G does not have loops: edges of the form [x,x]. (B.9-19)
IsOriented( G )
Returns true if whenever [x,y] is an edge (arrow) of G, [y,x] is not. (B.9-22)
IsSimple( G )
Returns true if G contains no loops and no arrows. (B.9-23)
IsSurface( G )
Returns true if every link of G is an n-cycle, for n≥ 4; false otherwise. (B.9-24)
IsUndirected( G )
Returns true if, whenever [x,y] is an edge (arrow) of G, [y,x] is also an edge of G. (B.9-27)
Link( G, x )
Returns the subgraph induced in G by the neighbors of x. (B.12-2)
Links( G )
Returns the list of subgraphs of G induced by the neighbors of each vertex of G. (B.12-3)
MaxDegree( G )
Returns the maximum degree in graph G. (B.13-1)
MinDegree( G )
Returns the minimum degree in graph G. (B.13-2)
NumberOfConnectedComponents( G )
Returns the number of connected components of G. (B.14-4)
Order( G )
Returns the number of vertices, of graph G. (B.15-3)
Radius( G )
Returns the minimal eccentricity among the vertices of graph G. (B.18-1)
Size( G )
Returns the number of edges of graph G. (B.19-4)
SpanningForest( G )
Returns a spanning forest of G. (B.19-6)
SpanningForestEdges( G )
Returns the edges of a spanning forest of G. (B.19-7)
VertexDegree( G, x )
Returns the degree of vertex x in graph G. (B.22-1)
VertexDegrees( G )
Returns the list of degrees of the vertices in graph G. (B.22-2)
VertexNames( G )
Returns the list of names of the vertices of G. (B.22-3)
Vertices( G )
Returns the list [1..Order( G )]. (B.22-4)
CliqueGraph( G )
CliqueGraph( G, maxNumCli )
Returns the intersection graph of the (maximal) cliques of G; aborts if maxNumCli cliques are found. (B.3-5)
ComplementGraph( G )
Returns a new graph H such that V(H)=V(G) and xy∈ E(H) <=> xy not\in E(G). (B.3-9)
CompletelyParedGraph( G )
Returns the graph obtained from G by iteratively removing all dominated vertices. (B.3-12)
Cone( G )
Returns a new graph obtained from G by adding a new vertex which is adjacent to all vertices of G. (B.3-16)
DistanceGraph( G, Dist )
Returns a new graph with the same vertices as G, where two vertices are adjacent iff the distance between them in G belongs to Dist. (B.4-9)
InducedSubgraph( G, V )
Returns the subgraph of graph G induced by the vertex set V. (B.9-4)
LineGraph( G )
Returns the intersection graph of the edges of G. (B.12-1)
ParedGraph( G )
Returns the induced subgraph obtained from G by removing its dominated vertices. (B.16-4)
PowerGraph( G, exp )
Returns a new graph where two vertices are neighbors iff their distance in G is less than or equal to exp. (B.16-8)
QuotientGraph( G, Part )
QuotientGraph( G, L1, L2 )
Returns the quotient graph of graph G given a vertex partition Part, by identifying any two vertices in the same part. (B.17-3)
Suspension( G )
Returns the graph obtained from G by adding two new vertices which are adjacent to every vertex of G but not to each other. (B.19-10)
BoxProduct( G, H );
Returns the box product (or Cartesian product) G□H of graphs G and H. (B.2-5)
BoxTimesProduct( G, H )
Returns the boxtimes product (or strong product) G⊠H of graphs G and H. (B.2-6)
Composition( G, H )
Returns the composition G[H] of two graphs G and H. (B.3-15)
DisjointUnion( G, H )
Returns the disjoint union of two graphs G and H. (B.4-6)
GraphSum( G, L )
Returns the lexicographic sum of a list of graphs L over a graph G. (B.7-15)
Join( G, H )
Returns the disjoint union of G and H with all the possible edges between G and H added. (B.10-2)
TimesProduct( G, H )
Returns the times product (or tensor product) G×H of two graphs G and H. (B.20-4)
Basement( G, KnG, x )
Basement( G, KnG, V )
Returns the basement of vertex x (vertex set V) of the iterated clique graph KnG with respect to G. (B.2-3)
CliqueGraph( G )
CliqueGraph( G, maxNumCli )
Returns the intersection graph of the (maximal) cliques of G; aborts if maxNumCli cliques are found. (B.3-5)
CliqueNumber( G )
Returns the order, ω(G), of a maximum clique of G. (B.3-6)
Cliques( G )
Cliques( G, maxNumCli )
Returns the list of (maximal) cliques of G; aborts if maxNumCli cliques are found. (B.3-7)
CompletesOfGivenOrder( G, ord )
Returns the list of vertex sets of all complete subgraphs of order ord of G. (B.3-14)
IsCliqueGated( G )
Returns true if G is a clique gated graph. (B.9-9)
IsCliqueHelly( G )
Returns true if the set of (maximal) cliques of G satisfy the Helly property. (B.9-10)
IsComplete( G, L )
Returns true if L induces a complete subgraph of G. (B.9-12)
IsCompleteGraph( G )
Returns true if graph G is a complete graph, false otherwise. (B.9-13)
NumberOfCliques( G )
NumberOfCliques( G, maxNumCli )
Returns the number of (maximal) cliques of G. (B.14-3)
We list here only primitive operations, many derived operations (over forty) for morphisms of graphs are discussed in Chapter 5.
IsIsomorphicGraph( G, H )
Returns true when G is isomorphic to H and false otherwise. (B.9-16)
IsoMorphism( G, H )
Returns one isomorphism from G to H; fail if there is none. (B.9-20)
IsoMorphisms( G, H )
Returns the list of all isomorphisms from G to H. (B.9-21)
NextIsoMorphism( G, H, F )
Returns the next isomorphism (after F) from G to H. (B.14-1)
NextPropertyMorphism( G, H, F, PropList )
Returns the next morphism (after F) from G to H satisfying the list of properties PropList. (B.14-2)
PropertyMorphism( G, H, PropList )
Returns the first morphism from G to H satisfying the list of properties PropList. (B.16-9)
PropertyMorphisms( G, H, PropList )
Returns all morphisms from G to H satisfying the list of properties PropList. (B.16-10)
CopyGraph( G )
Returns a fresh copy of G. Useful to change the category of a graph. (B.3-20)
GraphCategory( [ G, ... ] );
For internal use. Returns the minimal common category to a list of graphs. (B.7-12)
Graphs()
The category of all graphs that can be represented in YAGS. (B.7-13)
\in( G, Catgy )
G in Catgy
Returns true if graph G belongs to category Catgy and false otherwise. (B.9-3)
LooplessGraphs()
The category of all graph that may contain arrows and edges but no loops. (B.12-4)
OrientedGraphs()
The category of all graphs that may contain arrows but no edges or loops. (B.15-5)
SetDefaultGraphCategory( Catgy )
Sets the default graph category to Catgy. (B.19-2)
SimpleGraphs()
The category of all graphs which may contain edges but no arrows or loops. (B.19-3)
TargetGraphCategory( [ G, ... ] );
For internal use. Within YAGS methods, returns the graph category to which the new graph will belong. (B.20-1)
UndirectedGraphs()
The category of all graphs that may contain loops and edges but no arrows. (B.21-3)
InNeigh( G, x )
Returns the list of in-neighbors of x in G. (B.9-5)
IsTournament( G )
Returns true if G contains no loops or edges but only arrows and it is maximal w.r.t. this property. (B.9-25)
IsTransitiveTournament( G )
Returns true if G is a Tournament and whenever xy and yz are arrows, then xz is an arrow too. (B.9-26)
Orientations( G )
Returns the list of all the oriented graphs that are obtained from G by replacing each edge by one arrow. (B.15-4)
OutNeigh( G, x )
Returns the list of out-neighbors of x in G. (B.15-6)
PaleyTournament( prime )
Returns the Paley tournament associated with prime number prime. (B.16-1)
CayleyGraph( Grp )
CayleyGraph( Grp, Elms )
Returns the CayleyGraph of group Grp. (B.3-1)
Circulant( n, Jumps )
Returns the minimal graph invariant under the cyclic permutation (1 2 ⋯ n) such that the vertex 1 is adjacent to the vertices in Jumps. (B.3-3)
GroupGraph( G, Grp )
GroupGraph( G, Grp, Act )
Returns the minimal Grp-invariant (under the action Act) graph containing G. (B.7-18)
QuadraticRingGraph( Rng )
Returns a graph G whose vertices are the elements of the ring Rng and xy∈ E(G) <=> x+z^2=y for some z in Rng. (B.17-2)
RingGraph( Rng, Elms )
Returns the graph G whose vertices are the elements of the ring Rng such that x is adjacent to y iff x+r=y for some r in Elms. (B.18-10)
UnitsRingGraph( Rng )
Returns the graph G whose vertices are the elements of Rng such that x is adjacent to y iff x+z=y for some unit z of Rng. (B.21-4)
Backtrack( L, Opts, Chk, Done, Extra )
Returns the next solution (after L) to a backtracking combinatorial problem specified by its parameters. (B.2-1)
BacktrackBag( Opts, Chk, Done, Extra )
Returns the list of all solutions to a backtracking combinatorial problem specified by its parameters. (B.2-2)
DumpObject( Obj )
For internal use. Dumps all information available for object Obj. (B.4-16)
EasyExec( Dir, ProgName, InString )
EasyExec( ProgName, InString )
Calls the external program ProgName with input string InString; returns the output string. (B.5-1)
EquivalenceRepresentatives( L, Eqiv )
Returns a sublist of L, which is a complete list of representatives of L under the equivalent relation Equiv. (B.5-4)
IsBoolean( Obj )
Returns true if object Obj is true or false and false otherwise. (B.9-8)
QtfyIsSimple( G )
For internal use. Returns how far is graph G from being simple. (B.17-1)
RandomlyPermuted( Obj )
Returns a copy of Obj with the order of its elements permuted randomly. (B.18-6)
RandomPermutation( n )
Returns a random permutation of the list [1,2, ..., n]. (B.18-4)
RandomSubset( Set )
RandomSubset( Set, k )
RandomSubset( Set, p )
Returns a random subset of the set Set. It also works for lists though. (B.18-5)
TimeInSeconds()
Returns the time in seconds since 1970-01-01 00:00:00 UTC as an integer. (B.20-3)
UFFind( UFS, x )
For internal use. Implements the find operation on the union-find structure. (B.21-1)
UFUnite( UFS, x, y )
For internal use. Implements the unite operation on the union-find structure. (B.21-2)
YAGSExec( ProgName, InString )
For internal use. Calls external program ProgName located in directory YAGS-DIR/bin/ feeding it with InString as input and returning the output of the external program as a string. (B.24-1)
YAGSInfo
Global record where much YAGS-related information is stored. (B.24-2)
YAGSInfo.InfoClass
YAGS's progress reporting InfoClass. Several algorithms in YAGS report progress at InfoLevel 1 or 3. (B.24-3)
YAGSInfo.InfoOutput
Output file (or device) for YAGS's progress reporting InfoClass. (B.24-4)
We declare in this section the operations that, with higher probability, may disappear or change in a non-compatible manner in the future.
AutGroupGraph( G )
Returns the automorphism group of graph G. Use AutomorphismGroup( G ) instead. (B.1-8)
DeclareQtfyProperty( Name, Filter )
For internal use. Declare a quantifiable property. (B.4-2)
DumpObject( Obj )
For internal use. Dumps all information available for object Obj. (B.4-16)
EasyExec( Dir, ProgName, InString )
EasyExec( ProgName, InString )
Calls the external program ProgName with input string InString; returns the output string. (B.5-1)
GraphToRaw( FileName, G )
GraphToRaw( FileName, G, Highlighted )
Writes the graph G in raw format to the file FileName. (B.7-16)
GraphUpdateFromRaw( FileName, G )
Updates the coordinates of G from a file FileName in raw format. (B.7-17)
GroupGraph( G, Grp )
GroupGraph( G, Grp, Act )
Returns the minimal Grp-invariant (under the action Act) graph containing G. (B.7-18)
QtfyIsSimple( G )
For internal use. Returns how far is graph G from being simple. (B.17-1)
TimeInSeconds()
Returns the time in seconds since 1970-01-01 00:00:00 UTC as an integer. (B.20-3)
YAGSExec( ProgName, InString )
For internal use. Calls external program ProgName located in directory YAGS-DIR/bin/ feeding it with InString as input and returning the output of the external program as a string. (B.24-1)
YAGSInfo
Global record where much YAGS-related information is stored. (B.24-2)
YAGSPositionsTrueBlist( Blist )
For internal use. The same as ListBlist([1..Length(Blist)],Blist); (B.24-5)
generated by GAPDoc2HTML