Sophie

Sophie

distrib > Fedora > 15 > i386 > by-pkgid > 7ebd25ac536d248d499a3ce2acda963a > files > 5891

Macaulay2-1.3.1-8.fc15.i686.rpm

<?xml version="1.0" encoding="utf-8" ?>  <!-- for emacs: -*- coding: utf-8 -*- -->
<!-- Apache may like this line in the file .htaccess: AddCharset utf-8 .html -->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1 plus MathML 2.0 plus SVG 1.1//EN"	 "http://www.w3.org/2002/04/xhtml-math-svg/xhtml-math-svg-flat.dtd" >
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en">
<head><title>Symbol Index</title>
<link rel="stylesheet" type="text/css" href="../../../../Macaulay2/Style/doc.css"/>
</head>
<body><div><a href="index.html">top</a> | <a href="toc.html">toc</a> | <a href="http://www.math.uiuc.edu/Macaulay2/">Macaulay2 web site</a></div>
<hr/>
<h1>Symbol Index</h1>
<div><a href="#A">A</a>&nbsp;&nbsp;&nbsp;<a href="#B">B</a>&nbsp;&nbsp;&nbsp;<a href="#C">C</a>&nbsp;&nbsp;&nbsp;<a href="#D">D</a>&nbsp;&nbsp;&nbsp;<a href="#E">E</a>&nbsp;&nbsp;&nbsp;<a href="#F">F</a>&nbsp;&nbsp;&nbsp;<a href="#G">G</a>&nbsp;&nbsp;&nbsp;<a href="#H">H</a>&nbsp;&nbsp;&nbsp;<a href="#I">I</a>&nbsp;&nbsp;&nbsp;<a href="#J">J</a>&nbsp;&nbsp;&nbsp;<a href="#K">K</a>&nbsp;&nbsp;&nbsp;<a href="#L">L</a>&nbsp;&nbsp;&nbsp;<a href="#M">M</a>&nbsp;&nbsp;&nbsp;<a href="#N">N</a>&nbsp;&nbsp;&nbsp;<a href="#O">O</a>&nbsp;&nbsp;&nbsp;<a href="#P">P</a>&nbsp;&nbsp;&nbsp;<a href="#Q">Q</a>&nbsp;&nbsp;&nbsp;<a href="#R">R</a>&nbsp;&nbsp;&nbsp;<a href="#S">S</a>&nbsp;&nbsp;&nbsp;<a href="#T">T</a>&nbsp;&nbsp;&nbsp;<a href="#U">U</a>&nbsp;&nbsp;&nbsp;<a href="#V">V</a>&nbsp;&nbsp;&nbsp;<a href="#W">W</a>&nbsp;&nbsp;&nbsp;<a href="#X">X</a>&nbsp;&nbsp;&nbsp;<a href="#Y">Y</a>&nbsp;&nbsp;&nbsp;<a href="#Z">Z</a></div>
<ul><li><span><a id="A"/></span><span><a href="_adjacency__Matrix.html" title="returns adjacency matrix of a directed graph">adjacencyMatrix</a> -- returns adjacency matrix of a directed graph</span></li>
<li><span><a href="_all__Pairs__Shortest__Path.html" title="computes lengths of shortest paths between all pairs in a directed graph">allPairsShortestPath</a> -- computes lengths of shortest paths between all pairs in a directed graph</span></li>
<li><span><a id="B"/><a id="C"/></span><span><a href="_compare.html" title="returns boolean value for whether an element is less than another">compare</a> -- returns boolean value for whether an element is less than another</span></li>
<li><span><a id="D"/></span><span><a href="___Directed__Edges.html" title="the set of directed edges of a directed graph">DirectedEdges</a> -- the set of directed edges of a directed graph</span></li>
<li><span><a href="___Directed__Graph.html" title="a class for directed graphs">DirectedGraph</a> -- a class for directed graphs</span></li>
<li><span><a href="_directed__Graph.html" title="creating a directed graph">directedGraph</a> -- creating a directed graph</span></li>
<li><span><a id="E"/><a id="F"/></span><span><a href="_filter.html" title="returns a principal filter generated by the given element">filter</a> -- returns a principal filter generated by the given element</span></li>
<li><span><a id="G"/></span><span><a href="___Ground__Set.html" title="underlying set of a poset">GroundSet</a> -- underlying set of a poset</span></li>
<li><span><a id="H"/><a id="I"/></span><span><a href="_is__Lattice.html" title="determines if a poset is a lattice">isLattice</a> -- determines if a poset is a lattice</span></li>
<li><span><a id="J"/></span><span><a href="_join__Exists.html" title="determines if the join exists">joinExists</a> -- determines if the join exists</span></li>
<li><span><a id="K"/><a id="L"/></span><span><a href="_lcm__Lattice.html" title="returns the LCM lattice of an ideal">lcmLattice</a> -- returns the LCM lattice of an ideal</span></li>
<li><span><a id="M"/></span><span><a href="_meet__Exists.html" title="determines if the meet exists">meetExists</a> -- determines if the meet exists</span></li>
<li><span><a id="N"/><a id="O"/></span><span><a href="_order__Ideal.html" title="returns a principal order ideal generated by the given element">orderIdeal</a> -- returns a principal order ideal generated by the given element</span></li>
<li><span><a id="P"/></span><span><a href="___Poset.html" title="a class for partially ordered sets (posets)">Poset</a> -- a class for partially ordered sets (posets)</span></li>
<li><span><a href="_poset.html" title="creating a poset">poset</a> -- creating a poset</span></li>
<li><span><a href="_poset__Join.html" title="returns the join of two elements">posetJoin</a> -- returns the join of two elements</span></li>
<li><span><a href="_poset__Meet.html" title="returns the meet of two elements">posetMeet</a> -- returns the meet of two elements</span></li>
<li><span><a href="index.html" title="A package for working with posets.">Posets</a> -- A package for working with posets.</span></li>
<li><span><a id="Q"/><a id="R"/></span><span><a href="___Relation__Matrix.html" title="the matrix expressing all of the relations between elements in a Poset">RelationMatrix</a> -- the matrix expressing all of the relations between elements in a Poset</span></li>
<li><span><a href="___Relations.html" title="a set of relations in the poset that generates all other relations">Relations</a> -- a set of relations in the poset that generates all other relations</span></li>
<li><span><a id="S"/><a id="T"/></span><span><a href="_transitive__Closure.html" title="computes the transitive closure of a given set of relations.">transitiveClosure</a> -- computes the transitive closure of a given set of relations.</span></li>
<li><span><a id="U"/><a id="V"/></span><span><a href="___Vertices.html" title="the set of vertices a directed graph">Vertices</a> -- the set of vertices a directed graph</span></li>
</ul>
<div><span><a id="W"/><a id="X"/><a id="Y"/><a id="Z"/></span></div>
</body>
</html>