Now the main internal representation is by using adjacency lists and the main constructor is GraphByAdjacencies (B.7-6). The internal representations using adjacency matrices and GraphByAdjMatrix (B.7-7), may still be used. Many graph constructing procedures were optimized.
BacktrackBag (B.2-2) now starts internally with L:=[fail]. In this way, the empty list [ ] may be a solution if done(L,extra) approves it.
The empty graph EmptyGraph (B.5-4) is now permited. This affects Link (B.12-2) and Links (B.12-3).
New operation CopyCoordinates (B.3-20). The generation of coordinates for derived graphs (Like LineGraph (B.12-1) and CliqueGraph (B.3-5)) were added or standarized in this way.
Three new operations dealing with Brendan MacKay's graph6 format: GraphToGraph6 (B.7-16), ExportGraph6 (B.5-6) and ImportGraph6Iterator (B.9-3).
Deph first search (DFS) trees can now be computed using DFSTree (B.4-3).
Necessary changes for YAGS to work with GAP 4.10.0.
Much faster algorithm to compute the AutomorphismGroup (B.1-8) of a graph.
YAGS now knows how to draw arrow for directed graphs.
Minor changes to ensure compatibility with GAP versions 4.9.1, 4.9.2 and 4.10dev. Affected attributes, operations and functions: YAGSDiameter( Graph), Diameter (B.4-4) and YAGSPositionsTrueBlist (B.24-5).
PackageInfo.g updated to fulfill GAP's ValidatePackageInfo() requirements.
The following graph constructing operations now report an error when attempting to construct an empty graph: InducedSubgraph (B.9-5), GraphByAdjacencies (B.7-6), GraphByAdjMatrix (B.7-7), GraphByCompleteCover (B.7-8), GraphByEdges (B.7-9), GraphByRelation (B.7-10) and GraphByWalks (B.7-11).
Link (B.12-2) now returns fail when the given vertex has degree 0.
generated by GAPDoc2HTML