One Hat Cyber Team
Your IP :
216.73.216.14
Server IP :
194.44.31.54
Server :
Linux zen.imath.kiev.ua 4.18.0-553.77.1.el8_10.x86_64 #1 SMP Fri Oct 3 14:30:23 UTC 2025 x86_64
Server Software :
Apache/2.4.37 (Rocky Linux) OpenSSL/1.1.1k
PHP Version :
5.6.40
Buat File
|
Buat Folder
Eksekusi
Dir :
~
/
usr
/
share
/
doc
/
Macaulay2
/
Graphs
/
html
/
Edit File:
toc.html
<!DOCTYPE html> <html lang="en"> <head> <title>Graphs : Table of Contents</title> <meta content="text/html; charset=utf-8" http-equiv="Content-Type"> <link type="text/css" rel="stylesheet" href="../../../../Macaulay2/Style/doc.css"> <link rel="stylesheet" href="../../../../Macaulay2/Style/katex/katex.min.css"> <script defer="defer" src="../../../../Macaulay2/Style/katex/katex.min.js"></script> <script defer="defer" src="../../../../Macaulay2/Style/katex/contrib/auto-render.min.js"></script> <script> var macros = { "\\break": "\\\\", "\\ZZ": "\\mathbb{Z}", "\\NN": "\\mathbb{N}", "\\QQ": "\\mathbb{Q}", "\\RR": "\\mathbb{R}", "\\CC": "\\mathbb{C}", "\\PP": "\\mathbb{P}" }, delimiters = [ { left: "$$", right: "$$", display: true}, { left: "\\[", right: "\\]", display: true}, { left: "$", right: "$", display: false}, { left: "\\(", right: "\\)", display: false} ], ignoredTags = [ "kbd", "var", "samp", "script", "noscript", "style", "textarea", "pre", "code", "option" ]; document.addEventListener("DOMContentLoaded", function() { renderMathInElement(document.body, { delimiters: delimiters, macros: macros, ignoredTags: ignoredTags, trust: true }); }); </script> <style>.katex { font-size: 1em; }</style> <script defer="defer" src="../../../../Macaulay2/Style/katex/contrib/copy-tex.min.js"></script> <script defer="defer" src="../../../../Macaulay2/Style/katex/contrib/render-a11y-string.min.js"></script> <script src="../../../../Macaulay2/Style/prism.js"></script> <script>var current_version = '1.25.06';</script> <script src="../../../../Macaulay2/Style/version-select.js"></script> <link type="image/x-icon" rel="icon" href="../../../../Macaulay2/Style/icon.gif"> </head> <body> <div id="buttons"> <div> <a href="https://macaulay2.com/">Macaulay2</a> <span id="version-select-container"></span> » <a title="Macaulay2 documentation" href="../../Macaulay2Doc/html/index.html">Documentation </a> <br><a href="../../Macaulay2Doc/html/_packages_spprovided_spwith_sp__Macaulay2.html">Packages</a> » <span><a title="graphs and digraphs" href="index.html">Graphs</a> :: <a href="toc.html">Table of Contents</a></span> </div> <div class="right"> <form method="get" action="https://www.google.com/search"> <input placeholder="Search" type="text" name="q" value=""> <input type="hidden" name="q" value="site:macaulay2.com/doc"> </form> next | previous | forward | backward | up | <a href="master.html">index</a> | <a href="toc.html">toc</a> </div> </div> <hr> <h1>Graphs : Table of Contents</h1> <ul> <li><span><a title="graphs and digraphs" href="index.html">Graphs</a> -- graphs and digraphs</span></li> <li><span><a title="A method for adding edges to a graph" href="_add__Edge.html">addEdge</a> -- A method for adding edges to a graph</span></li> <li><span><a title="A method for adding a set of vertices to a graph" href="_add__Vertex.html">addVertex</a> -- A method for adding a set of vertices to a graph</span></li> <li><span><a title="Returns the adjacency matrix of a Graph or Digraph" href="_adjacency__Matrix.html">adjacencyMatrix</a> -- Returns the adjacency matrix of a Graph or Digraph</span></li> <li><span><a title="Returns the barbell graph" href="_barbell__Graph.html">barbellGraph</a> -- Returns the barbell graph</span></li> <li><span><a title="Returns the barycenter of a grah" href="_barycenter.html">barycenter</a> -- Returns the barycenter of a grah</span></li> <li><span><span class="tt">BFS</span> (missing documentation)<!--tag: BFS--> </span></li> <li><span><a title="Returns a coloring of a bipartite graph" href="_bipartite__Coloring.html">bipartiteColoring</a> -- Returns a coloring of a bipartite graph</span></li> <li><span><a title="runs a breadth first search on the digraph starting at a specified node" href="_breadth__First__Search.html">breadthFirstSearch</a> -- runs a breadth first search on the digraph starting at a specified node</span></li> <li><span><a title="Computes the cartesian product of two graphs" href="_cartesian__Product.html">cartesianProduct</a> -- Computes the cartesian product of two graphs</span></li> <li><span><a title="Returns the center of a graph" href="_center.html">center</a> -- Returns the center of a graph</span></li> <li><span><a title="returns the children of a vertex of a digraph" href="_children.html">children</a> -- returns the children of a vertex of a digraph</span></li> <li><span><a title="Computes the chromatic number of a graph" href="_chromatic__Number.html">chromaticNumber</a> -- Computes the chromatic number of a graph</span></li> <li><span><a title="Returns a circular ladder graph" href="_circular__Ladder.html">circularLadder</a> -- Returns a circular ladder graph</span></li> <li><span><a title="Returns the clique complex of a graph" href="_clique__Complex.html">cliqueComplex</a> -- Returns the clique complex of a graph</span></li> <li><span><a title="Returns the clique number of a graph" href="_clique__Number.html">cliqueNumber</a> -- Returns the clique number of a graph</span></li> <li><span><a title="Returns the closed neighborhood of a vertex of a graph" href="_closed__Neighborhood.html">closedNeighborhood</a> -- Returns the closed neighborhood of a vertex of a graph</span></li> <li><span><a title="a method for computing the clustering coefficient of a Graph" href="_clustering__Coefficient.html">clusteringCoefficient</a> -- a method for computing the clustering coefficient of a Graph</span></li> <li><span><a title="Returns a cocktail party graph" href="_cocktail__Party.html">cocktailParty</a> -- Returns a cocktail party graph</span></li> <li><span><a title="Returns the complement of a graph" href="_complement__Graph.html">complementGraph</a> -- Returns the complement of a graph</span></li> <li><span><a title="Constructs a complete graph" href="_complete__Graph.html">completeGraph</a> -- Constructs a complete graph</span></li> <li><span><a title="constructs a complete multipartite graph" href="_complete__Multipartite__Graph.html">completeMultipartiteGraph</a> -- constructs a complete multipartite graph</span></li> <li><span><a title="Computes the connected components of a graph" href="_connected__Components_lp__Graph_rp.html">connectedComponents(Graph)</a> -- Computes the connected components of a graph</span></li> <li><span><a title="Returns the vertex cover ideal of a graph" href="_cover__Ideal.html">coverIdeal</a> -- Returns the vertex cover ideal of a graph</span></li> <li><span><a title="Finds the critical edges of a graph" href="_critical__Edges.html">criticalEdges</a> -- Finds the critical edges of a graph</span></li> <li><span><a title="Returns a crown graph" href="_crown__Graph.html">crownGraph</a> -- Returns a crown graph</span></li> <li><span><a title="Constructs a cycle graph" href="_cycle__Graph.html">cycleGraph</a> -- Constructs a cycle graph</span></li> <li><span><a title="Computes the degeneracy of a graph" href="_degeneracy.html">degeneracy</a> -- Computes the degeneracy of a graph</span></li> <li><span><a title="returns the degree of a vertex in a digraph" href="_degree_lp__Digraph_cm__Thing_rp.html">degree(Digraph,Thing)</a> -- returns the degree of a vertex in a digraph</span></li> <li><span><a title="Returns the degreeCentrality of a vertex of a graph" href="_degree__Centrality.html">degreeCentrality</a> -- Returns the degreeCentrality of a vertex of a graph</span></li> <li><span><a title="returns the "in-degree" of a vertex in a digraph" href="_degree__In.html">degreeIn</a> -- returns the "in-degree" of a vertex in a digraph</span></li> <li><span><a title="Returns the degree matrix of a graph" href="_degree__Matrix.html">degreeMatrix</a> -- Returns the degree matrix of a graph</span></li> <li><span><a title="returns the "out-degree" of a vertex in a digraph" href="_degree__Out.html">degreeOut</a> -- returns the "out-degree" of a vertex in a digraph</span></li> <li><span><a title="the degree sequence of a graph" href="_degree__Sequence.html">degreeSequence</a> -- the degree sequence of a graph</span></li> <li><span><a title="Deletes a list of edges from a graph" href="_delete__Edges.html">deleteEdges</a> -- Deletes a list of edges from a graph</span></li> <li><span><a title="a method for deleting the vertex of a graph" href="_delete__Vertex.html">deleteVertex</a> -- a method for deleting the vertex of a graph</span></li> <li><span><a title="Deletes specified vertices from a digraph or graph" href="_delete__Vertices.html">deleteVertices</a> -- Deletes specified vertices from a digraph or graph</span></li> <li><span><a title="computes the density of a graph" href="_density.html">density</a> -- computes the density of a graph</span></li> <li><span><a title="runs a depth first search on the digraph" href="_depth__First__Search.html">depthFirstSearch</a> -- runs a depth first search on the digraph</span></li> <li><span><a title="returns the descendants of a digraph" href="_descendants.html">descendants</a> -- returns the descendants of a digraph</span></li> <li><span><span class="tt">descendents</span> (missing documentation)<!--tag: descendents--> </span></li> <li><span><span class="tt">DFS</span> (missing documentation)<!--tag: DFS--> </span></li> <li><span><a title="Computes the diameter of a graph" href="_diameter_lp__Graph_rp.html">diameter(Graph)</a> -- Computes the diameter of a graph</span></li> <li><span><a href="___Digraph.html">Digraph</a></span></li> <li><span><a title="Constructs a digraph" href="_digraph.html">digraph</a> -- Constructs a digraph</span></li> <li><span><a title="returns the transpose of a Digraph" href="_digraph__Transpose.html">digraphTranspose</a> -- returns the transpose of a Digraph</span></li> <li><span><a title="Computes the direct product of two graphs" href="_direct__Product.html">directProduct</a> -- Computes the direct product of two graphs</span></li> <li><span><span class="tt">discoveryTime</span> (missing documentation)<!--tag: discoveryTime--> </span></li> <li><span><a title="Returns the disjoint union of a list of graphs." href="_disjoint__Union.html">disjointUnion</a> -- Returns the disjoint union of a list of graphs.</span></li> <li><span><a title="displays a digraph or graph using Graphviz" href="_display__Graph.html">displayGraph</a> -- displays a digraph or graph using Graphviz</span></li> <li><span><a title="Computes the distance between two vertexSet in a graph" href="_distance.html">distance</a> -- Computes the distance between two vertexSet in a graph</span></li> <li><span><a title="Computes the distance matrix of a digraph" href="_distance__Matrix.html">distanceMatrix</a> -- Computes the distance matrix of a digraph</span></li> <li><span><a title="returns a double star graph" href="_double__Star.html">doubleStar</a> -- returns a double star graph</span></li> <li><span><a title="Returns the eccentricity of a vertex of a graph" href="_eccentricity.html">eccentricity</a> -- Returns the eccentricity of a vertex of a graph</span></li> <li><span><a title="computes the edge connectivity of a graph" href="_edge__Connectivity.html">edgeConnectivity</a> -- computes the edge connectivity of a graph</span></li> <li><span><a title="returns the edge cuts of a graph" href="_edge__Cuts.html">edgeCuts</a> -- returns the edge cuts of a graph</span></li> <li><span><a title="returns the edge ideal of a graph" href="_edge__Ideal.html">edgeIdeal</a> -- returns the edge ideal of a graph</span></li> <li><span><a title="Returns the edges of a digraph or graph" href="_edges.html">edges</a> -- Returns the edges of a digraph or graph</span></li> <li><span><a title="returns the expansion of a graph" href="_expansion.html">expansion</a> -- returns the expansion of a graph</span></li> <li><span><a title="finds all the paths in a digraph of a given length starting at a given vertex" href="_find__Paths.html">findPaths</a> -- finds all the paths in a digraph of a given length starting at a given vertex</span></li> <li><span><span class="tt">finishingTime</span> (missing documentation)<!--tag: finishingTime--> </span></li> <li><span><a title="runs the Floyd-Warshall algorithm on a digraph to determine the minimum distance from one vertex" href="_floyd__Warshall.html">floydWarshall</a> -- runs the Floyd-Warshall algorithm on a digraph to determine the minimum distance from one vertex</span></li> <li><span><a title="returns the forefathers of a digraph" href="_forefathers.html">forefathers</a> -- returns the forefathers of a digraph</span></li> <li><span><a title="Returns a friendship Graph" href="_friendship__Graph.html">friendshipGraph</a> -- Returns a friendship Graph</span></li> <li><span><a title="Returns a generalized petersen graph" href="_generalized__Petersen__Graph.html">generalizedPetersenGraph</a> -- Returns a generalized petersen graph</span></li> <li><span><a title="A method for computing the girth of a graph" href="_girth.html">girth</a> -- A method for computing the girth of a graph</span></li> <li><span><a href="___Graph.html">Graph</a></span></li> <li><span><a title="Constructs a simple graph" href="_graph.html">graph</a> -- Constructs a simple graph</span></li> <li><span><a title="Returns the legacy G#graph hash table" href="_graph_lp__Digraph_rp.html">graph(Digraph)</a> -- Returns the legacy G#graph hash table</span></li> <li><span><a title="A method for composing two graphs" href="_graph__Composition.html">graphComposition</a> -- A method for composing two graphs</span></li> <li><span><a title="constructs a graph of a type specified in the string input" href="_graph__Library.html">graphLibrary</a> -- constructs a graph of a type specified in the string input</span></li> <li><span><a title="constructs a graph raised to a power" href="_graph__Power.html">graphPower</a> -- constructs a graph raised to a power</span></li> <li><span><a title="determines whether a graph or a digraph has an Eulerian trail" href="_has__Eulerian__Trail.html">hasEulerianTrail</a> -- determines whether a graph or a digraph has an Eulerian trail</span></li> <li><span><a title="checks whether a graph has a odd hole" href="_has__Odd__Hole.html">hasOddHole</a> -- checks whether a graph has a odd hole</span></li> <li><span><a title="Create an .svg representation of a graph or digraph" href="_html_lp__Digraph_rp.html">html(Digraph)</a> -- Create an .svg representation of a graph or digraph</span></li> <li><span><a title="computes the incidence matrix of a graph" href="_incidence__Matrix.html">incidenceMatrix</a> -- computes the incidence matrix of a graph</span></li> <li><span><a title="constructs the independence complex of a graph" href="_independence__Complex.html">independenceComplex</a> -- constructs the independence complex of a graph</span></li> <li><span><a title="computes the independence number of a graph" href="_independence__Number.html">independenceNumber</a> -- computes the independence number of a graph</span></li> <li><span><a title="Relabels the vertices of a graph or digraph according to their indices, indexed from 0." href="_index__Label__Graph.html">indexLabelGraph</a> -- Relabels the vertices of a graph or digraph according to their indices, indexed from 0.</span></li> <li><span><a title="A method for finding the induced subgraph of any Graph or Digraph" href="_induced__Subgraph.html">inducedSubgraph</a> -- A method for finding the induced subgraph of any Graph or Digraph</span></li> <li><span><a title="determines whether a graph is bipartite" href="_is__Bipartite.html">isBipartite</a> -- determines whether a graph is bipartite</span></li> <li><span><a title="checks whether a graph is chordal" href="_is__Chordal.html">isChordal</a> -- checks whether a graph is chordal</span></li> <li><span><a title="determines if a graph is Cohen-Macaulay" href="_is__C__M.html">isCM</a> -- determines if a graph is Cohen-Macaulay</span></li> <li><span><a title="determines whether a graph is connected" href="_is__Connected.html">isConnected</a> -- determines whether a graph is connected</span></li> <li><span><a title="determines whether a graph is cyclic" href="_is__Cyclic.html">isCyclic</a> -- determines whether a graph is cyclic</span></li> <li><span><a title="determines whether a digraph is cyclic" href="_is__Cyclic_lp__Digraph_rp.html">isCyclic(Digraph)</a> -- determines whether a digraph is cyclic</span></li> <li><span><a title="determines if a graph or digraph is Eulerian" href="_is__Eulerian.html">isEulerian</a> -- determines if a graph or digraph is Eulerian</span></li> <li><span><a title="determines whether a graph is a forest" href="_is__Forest.html">isForest</a> -- determines whether a graph is a forest</span></li> <li><span><a title="determines whether a vertex is a leaf" href="_is__Leaf.html">isLeaf</a> -- determines whether a vertex is a leaf</span></li> <li><span><a title="checks whether a graph is perfect" href="_is__Perfect.html">isPerfect</a> -- checks whether a graph is perfect</span></li> <li><span><a title="checks if a vertex u is reachable from a vertex v" href="_is__Reachable.html">isReachable</a> -- checks if a vertex u is reachable from a vertex v</span></li> <li><span><a title="determines whether a graph is regular" href="_is__Regular.html">isRegular</a> -- determines whether a graph is regular</span></li> <li><span><a title="checks if a graph is rigid" href="_is__Rigid.html">isRigid</a> -- checks if a graph is rigid</span></li> <li><span><a title="checks if a graph is simple" href="_is__Simple.html">isSimple</a> -- checks if a graph is simple</span></li> <li><span><a title="determines if a vertex of a digraph is a sink or not" href="_is__Sink.html">isSink</a> -- determines if a vertex of a digraph is a sink or not</span></li> <li><span><a title="determines if a vertex of a digraph is a source or not" href="_is__Source.html">isSource</a> -- determines if a vertex of a digraph is a source or not</span></li> <li><span><a title="checks if a digraph is strongly connected" href="_is__Strongly__Connected.html">isStronglyConnected</a> -- checks if a digraph is strongly connected</span></li> <li><span><a title="determines whether a graph is a tree" href="_is__Tree.html">isTree</a> -- determines whether a graph is a tree</span></li> <li><span><a title="checks if a digraph is weakly connected" href="_is__Weakly__Connected.html">isWeaklyConnected</a> -- checks if a digraph is weakly connected</span></li> <li><span><a title="constructs a kneser graph of specified size" href="_kneser__Graph.html">kneserGraph</a> -- constructs a kneser graph of specified size</span></li> <li><span><a title="Returns a ladder graph" href="_ladder__Graph.html">ladderGraph</a> -- Returns a ladder graph</span></li> <li><span><a title="Returns the laplacian matrix of a graph" href="_laplacian__Matrix.html">laplacianMatrix</a> -- Returns the laplacian matrix of a graph</span></li> <li><span><a title="lists the leaves of a tree graph" href="_leaves.html">leaves</a> -- lists the leaves of a tree graph</span></li> <li><span><span class="tt">lexicographicProduct</span> (missing documentation)<!--tag: lexicographicProduct--> </span></li> <li><span><a title="Returns the line graph of an undirected graph" href="_line__Graph.html">lineGraph</a> -- Returns the line graph of an undirected graph</span></li> <li><span><a title="constructs a lollipop graph" href="_lollipop__Graph.html">lollipopGraph</a> -- constructs a lollipop graph</span></li> <li><span><a title="determines the lowest common ancestors between two vertexSet" href="_lowest__Common__Ancestors.html">lowestCommonAncestors</a> -- determines the lowest common ancestors between two vertexSet</span></li> <li><span><a title="computes the minimal degree of a graph" href="_minimal__Degree.html">minimalDegree</a> -- computes the minimal degree of a graph</span></li> <li><span><a title="finds the minimal vertex cuts of a graph" href="_minimal__Vertex__Cuts.html">minimalVertexCuts</a> -- finds the minimal vertex cuts of a graph</span></li> <li><span><a title="Returns a monomial graph" href="_monomial__Graph.html">monomialGraph</a> -- Returns a monomial graph</span></li> <li><span><a title="returns the neighbors of a vertex in a graph" href="_neighbors.html">neighbors</a> -- returns the neighbors of a vertex in a graph</span></li> <li><span><a title="key used in the output of topSort" href="_new__Digraph.html">newDigraph</a> -- key used in the output of topSort</span></li> <li><span><a title="returns the nondescendants of a vertex of a digraph" href="_nondescendants.html">nondescendants</a> -- returns the nondescendants of a vertex of a digraph</span></li> <li><span><span class="tt">nondescendents</span> (missing documentation)<!--tag: nondescendents--> </span></li> <li><span><a title="returns the non-neighbors of a vertex in a graph" href="_nonneighbors.html">nonneighbors</a> -- returns the non-neighbors of a vertex in a graph</span></li> <li><span><a title="computes the number of connected components of a graph" href="_number__Of__Components.html">numberOfComponents</a> -- computes the number of connected components of a graph</span></li> <li><span><a title="counts how many subtriangles are present in a graph" href="_number__Of__Triangles.html">numberOfTriangles</a> -- counts how many subtriangles are present in a graph</span></li> <li><span><a title="returns the parents of a vertex on a digraph" href="_parents.html">parents</a> -- returns the parents of a vertex on a digraph</span></li> <li><span><a title="A method that makes a path graph" href="_path__Graph.html">pathGraph</a> -- A method that makes a path graph</span></li> <li><span><span class="tt">prismGraph</span> (missing documentation)<!--tag: prismGraph--> </span></li> <li><span><a title="Returns the radius of a graph" href="_radius.html">radius</a> -- Returns the radius of a graph</span></li> <li><span><a title="Returns a rattle graph" href="_rattle__Graph.html">rattleGraph</a> -- Returns a rattle graph</span></li> <li><span><a title="Returns the vertices reachable in a digraph from a given collection of vertices" href="_reachable.html">reachable</a> -- Returns the vertices reachable in a digraph from a given collection of vertices</span></li> <li><span><a title="reindexes the vertices according to the input ordering." href="_reindex__By.html">reindexBy</a> -- reindexes the vertices according to the input ordering.</span></li> <li><span><span class="tt">removeNodes</span> (missing documentation)<!--tag: removeNodes--> </span></li> <li><span><a title="runs a reverse breadth first search on the digraph starting at a specified node" href="_reverse__Breadth__First__Search.html">reverseBreadthFirstSearch</a> -- runs a reverse breadth first search on the digraph starting at a specified node</span></li> <li><span><a title="Writes a string of TikZ syntax that can be pasted into a .tex file to display G" href="_show__Tik__Z.html">showTikZ</a> -- Writes a string of TikZ syntax that can be pasted into a .tex file to display G</span></li> <li><span><span class="tt">simpleGraph</span> (missing documentation)<!--tag: simpleGraph--> </span></li> <li><span><span class="tt">Singletons</span> (missing documentation)<!--tag: Singletons--> </span></li> <li><span><a title="returns the sinks of a digraph" href="_sinks.html">sinks</a> -- returns the sinks of a digraph</span></li> <li><span><a title="hashtable used in topSort" href="___Sorted__Digraph.html">SortedDigraph</a> -- hashtable used in topSort</span></li> <li><span><a title="returns the sources of a digraph" href="_sources.html">sources</a> -- returns the sources of a digraph</span></li> <li><span><a title="constructs a spanning forest of a graph" href="_spanning__Forest.html">spanningForest</a> -- constructs a spanning forest of a graph</span></li> <li><span><a title="Returns the spectrum of a graph" href="_spectrum.html">spectrum</a> -- Returns the spectrum of a graph</span></li> <li><span><a title="Returns a star graph" href="_star__Graph.html">starGraph</a> -- Returns a star graph</span></li> <li><span><a title="a method for taking the strong product of two graphs" href="_strong__Product.html">strongProduct</a> -- a method for taking the strong product of two graphs</span></li> <li><span><a title="A method that generates a threshold graph from a binary list" href="_threshold__Graph.html">thresholdGraph</a> -- A method that generates a threshold graph from a binary list</span></li> <li><span><a title="outputs a list of vertices in a topologically sorted order of a DAG." href="_topological__Sort.html">topologicalSort</a> -- outputs a list of vertices in a topologically sorted order of a DAG.</span></li> <li><span><a title="topologically sort the vertices of a digraph" href="_top__Sort.html">topSort</a> -- topologically sort the vertices of a digraph</span></li> <li><span><a title="Returns the underlying graph of a digraph" href="_underlying__Graph.html">underlyingGraph</a> -- Returns the underlying graph of a digraph</span></li> <li><span><a title="computes the vertex connectivity of a graph" href="_vertex__Connectivity.html">vertexConnectivity</a> -- computes the vertex connectivity of a graph</span></li> <li><span><a title="returns the vertex cover number of a graph" href="_vertex__Cover__Number.html">vertexCoverNumber</a> -- returns the vertex cover number of a graph</span></li> <li><span><a title="returns a list of the minimal vertex covers of a graph" href="_vertex__Covers.html">vertexCovers</a> -- returns a list of the minimal vertex covers of a graph</span></li> <li><span><a title="lists all the vertex cuts of a graph" href="_vertex__Cuts.html">vertexCuts</a> -- lists all the vertex cuts of a graph</span></li> <li><span><a href="_vertex__Multiplication.html">vertexMultiplication</a></span></li> <li><span><a title="Returns the vertices of a graph or digraph" href="_vertex__Set.html">vertexSet</a> -- Returns the vertices of a graph or digraph</span></li> <li><span><a title="Constructs a wheel graph" href="_wheel__Graph.html">wheelGraph</a> -- Constructs a wheel graph</span></li> <li><span><a title="Constructs a windmill graph" href="_windmill__Graph.html">windmillGraph</a> -- Constructs a windmill graph</span></li> <li><span><a title="Writes a graph to a dot file with a specified filename" href="_write__Dot__File.html">writeDotFile</a> -- Writes a graph to a dot file with a specified filename</span></li> </ul> </body> </html>
Simpan