home *** CD-ROM | disk | FTP | other *** search
/ Liren Large Software Subsidy 9 / 09.iso / e / e032 / 3.ddi / FILES / DISCRETE.PAK / MASTER.M < prev    next >
Encoding:
Text File  |  1992-07-29  |  6.9 KB  |  128 lines
  1. (* :Title: Master Declarations File for DiscreteMath *)
  2.  
  3. (* :Summary:
  4.     This file contains declarations of all the major symbols
  5.     contained in files in this directory.  Load it, and it sets
  6.     up the symbols with attribute Stub, so the correct package
  7.     will be loaded when the symbol is called.  *)
  8.  
  9. (* :Author: This file created by an automated system written in
  10.     Mathematica by John M. Novak *)
  11.  
  12. (* :History: File created on 21 Feb. 1992 at 16:28 *)
  13.  
  14. (* Declarations for file DiscreteMath`CombinatorialFunctions` *)
  15.  
  16. DeclarePackage["DiscreteMath`CombinatorialFunctions`",
  17.   {"CatalanNumber", "Fibonacci", "Hofstadter", "Subfactorial"}]
  18.  
  19.  
  20. (* Declarations for file DiscreteMath`Combinatorica` *)
  21.  
  22. DeclarePackage["DiscreteMath`Combinatorica`",
  23.   {"AcyclicQ", "AddEdge", "AddVertex", "AllPairsShortestPath", 
  24.    "ArticulationVertices", "Automorphisms", "Backtrack", 
  25.    "BiconnectedComponents", "BiconnectedQ", "BinarySearch", "BinarySubsets", 
  26.    "BipartiteMatching", "BipartiteQ", "BreadthFirstTraversal", "Bridges", 
  27.    "CartesianProduct", "CatalanNumber", "ChangeEdges", "ChangeVertices", 
  28.    "ChromaticNumber", "ChromaticPolynomial", "CirculantGraph", 
  29.    "CircularVertices", "CliqueQ", "CodeToLabeledTree", "Cofactor", "CompleteQ", 
  30.    "Compositions", "ConnectedComponents", "ConnectedQ", "ConstructTableau", 
  31.    "Contract", "CostOfPath", "Cycle", "DeBruijnSequence", "DegreeSequence", 
  32.    "DeleteCycle", "DeleteEdge", "DeleteFromTableau", "DeleteVertex", 
  33.    "DepthFirstTraversal", "DerangementQ", "Derangements", "Diameter", 
  34.    "Dijkstra", "DilateVertices", "DilworthGraph", "Directed", 
  35.    "DistinctPermutations", "Distribution", "DurfeeSquare", "Eccentricity", 
  36.    "Edge", "EdgeChromaticNumber", "EdgeColoring", "EdgeConnectivity", "Edges", 
  37.    "Element", "EmptyGraph", "EmptyQ", "EncroachingListSet", 
  38.    "EquivalenceClasses", "EquivalenceRelationQ", "Equivalences", "Eulerian", 
  39.    "EulerianCycle", "EulerianQ", "ExactRandomGraph", "ExpandGraph", 
  40.    "ExtractCycles", "FerrersDiagram", "FindCycle", "FindSet", 
  41.    "FirstLexicographicTableau", "FromAdjacencyLists", "FromCycles", 
  42.    "FromInversionVector", "FromOrderedPairs", "FromUnorderedPairs", 
  43.    "FunctionalGraph", "Girth", "Graph", "GraphCenter", "GraphComplement", 
  44.    "GraphDifference", "GraphicQ", "GraphIntersection", "GraphJoin", 
  45.    "GraphPower", "GraphProduct", "GraphSum", "GraphUnion", "GrayCode", 
  46.    "GridGraph", "HamiltonianCycle", "HamiltonianQ", "Harary", "HasseDiagram", 
  47.    "Heapify", "HeapSort", "HideCycles", "Hypercube", "IdenticalQ", 
  48.    "IncidenceMatrix", "IndependentSetQ", "Index", "InduceSubgraph", 
  49.    "InitializeUnionFind", "InsertIntoTableau", "IntervalGraph", 
  50.    "InversePermutation", "Inversions", "InvolutionQ", "IsomorphicQ", 
  51.    "Isomorphism", "IsomorphismQ", "Josephus", "K", "KSubsets", 
  52.    "LabeledTreeToCode", "LastLexicographicTableau", 
  53.    "LexicographicPermutations", "LexicographicSubsets", "LineGraph", 
  54.    "LongestIncreasingSubsequence", "M", "MakeGraph", "MakeSimple", 
  55.    "MakeUndirected", "MaximalMatching", "MaximumAntichain", "MaximumClique", 
  56.    "MaximumIndependentSet", "MaximumSpanningTree", "MinimumChainPartition", 
  57.    "MinimumChangePermutations", "MinimumSpanningTree", "MinimumVertexCover", 
  58.    "MultiplicationTable", "NetworkFlow", "NetworkFlowEdges", "NextComposition", 
  59.    "NextKSubset", "NextPartition", "NextPermutation", "NextSubset", 
  60.    "NextTableau", "NormalizeVertices", "NthPair", "NthPermutation", 
  61.    "NthSubset", "NumberOfCompositions", "NumberOfDerangements", 
  62.    "NumberOfInvolutions", "NumberOfPartitions", "NumberOfPermutationsByCycles", 
  63.    "NumberOfSpanningTrees", "NumberOfTableaux", "OrientGraph", "PartialOrderQ", 
  64.    "PartitionQ", "Partitions", "Path", "PathConditionGraph", "PerfectQ", 
  65.    "PermutationGroupQ", "PermutationQ", "Permute", "PlanarQ", "PointsAndLines", 
  66.    "Polya", "PseudographQ", "RadialEmbedding", "Radius", "RandomComposition", 
  67.    "RandomGraph", "RandomHeap", "RandomKSubset", "RandomPartition", 
  68.    "RandomPermutation", "RandomPermutation1", "RandomPermutation2", 
  69.    "RandomSubset", "RandomTableau", "RandomTree", "RandomVertices", 
  70.    "RankedEmbedding", "RankGraph", "RankPermutation", "RankSubset", 
  71.    "ReadGraph", "RealizeDegreeSequence", "RegularGraph", "RegularQ", 
  72.    "RemoveSelfLoops", "RevealCycles", "RootedEmbedding", "RotateVertices", 
  73.    "Runs", "SamenessRelation", "SelectionSort", "SelfComplementaryQ", 
  74.    "ShakeGraph", "ShortestPath", "ShortestPathSpanningTree", "ShowGraph", 
  75.    "ShowLabeledGraph", "SignaturePermutation", "SimpleQ", "Spectrum", 
  76.    "SpringEmbedding", "StableMarriage", "Star", "StirlingFirst", 
  77.    "StirlingSecond", "Strings", "StronglyConnectedComponents", "Subsets", 
  78.    "TableauClasses", "TableauQ", "Tableaux", "TableauxToPermutation", 
  79.    "ToAdjacencyLists", "ToCycles", "ToInversionVector", "ToOrderedPairs", 
  80.    "TopologicalSort", "ToUnorderedPairs", "TransitiveClosure", "TransitiveQ", 
  81.    "TransitiveReduction", "TranslateVertices", "TransposePartition", 
  82.    "TransposeTableau", "TravelingSalesman", "TravelingSalesmanBounds", "TreeQ", 
  83.    "TriangleInequalityQ", "Turan", "TwoColoring", "Undirected", "UndirectedQ", 
  84.    "UnionSet", "UnweightedQ", "V", "VertexColoring", "VertexConnectivity", 
  85.    "VertexCoverQ", "Vertices", "WeaklyConnectedComponents", "Wheel", 
  86.    "WriteGraph"}]
  87.  
  88.  
  89. (* Declarations for file DiscreteMath`ComputationalGeometry` *)
  90.  
  91. DeclarePackage["DiscreteMath`ComputationalGeometry`",
  92.   {"AllPoints", "ConvexHull", "DelaunayTriangulation", 
  93.    "DelaunayTriangulationQ", "DiagramPlot", "Hull", "LabelPoints", 
  94.    "NearestNeighbor", "PlanarGraphPlot", "Ray", "TriangularSurfacePlot", 
  95.    "TrimPoints", "VoronoiDiagram"}]
  96.  
  97.  
  98. (* Declarations for file DiscreteMath`Permutations` *)
  99.  
  100. DeclarePackage["DiscreteMath`Permutations`",
  101.   {"FromCycles", "Ordering", "PermutationQ", "RandomPermutation", "ToCycles"}]
  102.  
  103.  
  104. (* Declarations for file DiscreteMath`RSolve` *)
  105.  
  106. DeclarePackage["DiscreteMath`RSolve`",
  107.   {"ArgPi", "ConjugateQ", "EGf", "Entails", "Even", 
  108.    "ExponentialGeneratingFunction", "ExponentialPowerSum", "FactorialSimplify", 
  109.    "FirstPos", "FreeL", "GeneratingFunction", "Gf", "HSolve", 
  110.    "HypergeometricF", "ImP", "Info", "ISolve", "K", "LeadingCoef", 
  111.    "ListComplement", "MakeList", "MakeReal", "MakeTrinomial", "MethodEGF", 
  112.    "MethodGF", "Methods", "Odd", "PartialFractions", "PatternList", 
  113.    "PoleMultiplicity", "PowerSum", "PrecisionHS", "PrecisionST", "RealQ", 
  114.    "ReP", "Reset", "RSolve", "SafeFirst", "SafeSeries", "SeriesTerm", 
  115.    "SimplifyComplexE1", "SimplifyComplexE2", "SimplifyComplexN", 
  116.    "SimplifyComplex2", "SimplifyComplex3", "SimplifyComplex4", "SimplifySum", 
  117.    "SimplifyTrig", "SpecialFunctions", "SymbolicMod", "TTQ", "UseApart", 
  118.    "UseMod", "UserSymbols", "When"}]
  119.  
  120.  
  121. (* Declarations for file DiscreteMath`Tree` *)
  122.  
  123. DeclarePackage["DiscreteMath`Tree`",
  124.   {"ExprPlot", "MakeTree", "TreeFind", "TreePlot"}]
  125.  
  126.  
  127. (* End of Master Package *)
  128.