(* :Title: Master Declarations File for DiscreteMath *)

(* :Summary:
This file contains declarations of all the major symbols
contained in files in this directory.  When loaded, it sets
up the symbols with attribute Stub, so the correct package
will be loaded when the symbol is called.
*)

(* :Author: This file was created by an automated system written in
	Mathematica by John M. Novak *)

(* :History: File created on 9 November 1998 at 16:14 *)

BeginPackage["DiscreteMath`"]
EndPackage[]

(* Declarations for package DiscreteMath`CombinatorialFunctions` *)

DeclarePackage["DiscreteMath`CombinatorialFunctions`",
     {"CatalanNumber", "Hofstadter", "Subfactorial"}]


(* Declarations for package DiscreteMath`Combinatorica` *)

DeclarePackage["DiscreteMath`Combinatorica`",
     {"AcyclicQ", "AddEdge", "AddVertex", "AllPairsShortestPath", 
      "ArticulationVertices", "Automorphisms", "Backtrack", 
      "BiconnectedComponents", "BiconnectedQ", "BinarySearch", "BinarySubsets", 
      "BipartiteMatching", "BipartiteQ", "BreadthFirstTraversal", "Bridges", 
      "CartesianProduct", "ChangeEdges", "ChangeVertices", "ChromaticNumber", 
      "ChromaticPolynomial", "CirculantGraph", "CircularVertices", "CliqueQ", 
      "CodeToLabeledTree", "Cofactor", "CompleteGraph", "CompleteQ", 
      "Compositions", "ConnectedComponents", "ConnectedQ", "ConstructTableau", 
      "Contract", "CostOfPath", "Cycle", "DeBruijnSequence", "DegreeSequence", 
      "DeleteCycle", "DeleteEdge", "DeleteFromTableau", "DeleteVertex", 
      "DepthFirstTraversal", "DerangementQ", "Derangements", "Diameter", 
      "Dijkstra", "DilateVertices", "DilworthGraph", "Directed", 
      "DistinctPermutations", "Distribution", "DurfeeSquare", "Eccentricity", 
      "Edge", "EdgeChromaticNumber", "EdgeColoring", "EdgeConnectivity", 
      "Edges", "EmptyGraph", "EmptyQ", "EncroachingListSet", 
      "EquivalenceClasses", "EquivalenceRelationQ", "Equivalences", "Eulerian", 
      "EulerianCycle", "EulerianQ", "ExactRandomGraph", "ExpandGraph", 
      "ExtractCycles", "FerrersDiagram", "FindCycle", "FindSet", 
      "FirstLexicographicTableau", "FromAdjacencyLists", "FromInversionVector", 
      "FromOrderedPairs", "FromUnorderedPairs", "FunctionalGraph", "Girth", 
      "Graph", "GraphCenter", "GraphComplement", "GraphDifference", "GraphicQ", 
      "GraphIntersection", "GraphJoin", "GraphPower", "GraphProduct", 
      "GraphSum", "GraphUnion", "GrayCode", "GridGraph", "HamiltonianCycle", 
      "HamiltonianQ", "Harary", "HasseDiagram", "Heapify", "HeapSort", 
      "HideCycles", "Hypercube", "IdenticalQ", "IncidenceMatrix", 
      "IndependentSetQ", "Index", "InduceSubgraph", "InitializeUnionFind", 
      "InsertIntoTableau", "IntervalGraph", "InversePermutation", "Inversions", 
      "InvolutionQ", "IsomorphicQ", "Isomorphism", "IsomorphismQ", "Josephus", 
      "KSubsets", "LabeledTreeToCode", "LastLexicographicTableau", 
      "LexicographicPermutations", "LexicographicSubsets", "LineGraph", 
      "LongestIncreasingSubsequence", "M", "MakeGraph", "MakeSimple", 
      "MakeUndirected", "MaximalMatching", "MaximumAntichain", "MaximumClique", 
      "MaximumIndependentSet", "MaximumSpanningTree", "MinimumChainPartition", 
      "MinimumChangePermutations", "MinimumSpanningTree", "MinimumVertexCover", 
      "MultiplicationTable", "NetworkFlow", "NetworkFlowEdges", 
      "NextComposition", "NextKSubset", "NextPartition", "NextPermutation", 
      "NextSubset", "NextTableau", "NormalizeVertices", "NthPair", 
      "NthPermutation", "NthSubset", "NumberOfCompositions", 
      "NumberOfDerangements", "NumberOfInvolutions", "NumberOfPartitions", 
      "NumberOfPermutationsByCycles", "NumberOfSpanningTrees", 
      "NumberOfTableaux", "OrientGraph", "PartialOrderQ", "PartitionQ", 
      "Partitions", "PathConditionGraph", "PerfectQ", "PermutationGroupQ", 
      "Permute", "PlanarQ", "PointsAndLines", "Polya", "PseudographQ", 
      "RadialEmbedding", "Radius", "RandomComposition", "RandomGraph", 
      "RandomHeap", "RandomKSubset", "RandomPartition", "RandomPermutation1", 
      "RandomPermutation2", "RandomSubset", "RandomTableau", "RandomTree", 
      "RandomVertices", "RankedEmbedding", "RankGraph", "RankPermutation", 
      "RankSubset", "ReadGraph", "RealizeDegreeSequence", "RegularGraph", 
      "RegularQ", "RemoveSelfLoops", "RevealCycles", "RootedEmbedding", 
      "RotateVertices", "Runs", "SamenessRelation", "SelectionSort", 
      "SelfComplementaryQ", "ShakeGraph", "ShortestPath", 
      "ShortestPathSpanningTree", "ShowGraph", "ShowLabeledGraph", 
      "SignaturePermutation", "SimpleQ", "Spectrum", "SpringEmbedding", 
      "StableMarriage", "Star", "StirlingFirst", "StirlingSecond", "Strings", 
      "StronglyConnectedComponents", "Subsets", "TableauClasses", "TableauQ", 
      "Tableaux", "TableauxToPermutation", "ToAdjacencyLists", 
      "ToInversionVector", "ToOrderedPairs", "TopologicalSort", 
      "ToUnorderedPairs", "TransitiveClosure", "TransitiveQ", 
      "TransitiveReduction", "TranslateVertices", "TransposePartition", 
      "TransposeTableau", "TravelingSalesman", "TravelingSalesmanBounds", 
      "TreeQ", "TriangleInequalityQ", "Turan", "TwoColoring", "Undirected", 
      "UndirectedQ", "UnionSet", "UnweightedQ", "V", "VertexColoring", 
      "VertexConnectivity", "VertexCoverQ", "Vertices", 
      "WeaklyConnectedComponents", "Wheel", "WriteGraph"}]


(* Declarations for package DiscreteMath`ComputationalGeometry` *)

DeclarePackage["DiscreteMath`ComputationalGeometry`",
     {"AllPoints", "BoundedDiagram", "ConvexHull", "DelaunayTriangulation", 
      "DelaunayTriangulationQ", "DiagramPlot", "Hull", "LabelPoints", 
      "NearestNeighbor", "PlanarGraphPlot", "Ray", "TileAreas", 
      "TriangularSurfacePlot", "TrimPoints", "VoronoiDiagram"}]


(* Declarations for package DiscreteMath`DiscreteStep` *)

DeclarePackage["DiscreteMath`DiscreteStep`",
     {"DiscreteStep", "SimplifyDiscreteStep"}]


(* Declarations for package DiscreteMath`IntegerPartitions` *)

DeclarePackage["DiscreteMath`IntegerPartitions`",
     {"ConstrainedIntegerPartitionsP", "FerrersPlot", "FerrersPlotColumns", 
      "FerrersPlotLabel", "FerrersPlotPointSize", "IntegerPartitionQ", 
      "IntegerPartitions", "MultiplicityFromRepetition", 
      "NextIntegerPartition", "PreviousIntegerPartition", 
      "RandomIntegerPartition", "RepetitionFromMultiplicity", 
      "RestrictedIntegerPartitionsP", "TransposeIntegerPartition"}]


(* Declarations for package DiscreteMath`Permutations` *)

DeclarePackage["DiscreteMath`Permutations`",
     {"FromCycles", "Ordering", "PermutationQ", "RandomPermutation", "ToCycles"}
     ]


(* Declarations for package DiscreteMath`RSolve` *)

DeclarePackage["DiscreteMath`RSolve`",
     {"EGf", "Even", "ExponentialGeneratingFunction", 
      "ExponentialGeneratingFunctionConstants", "ExponentialPowerSum", 
      "GeneratingFunction", "GeneratingFunctionConstants", "Gf", "HSolve", 
      "HSolveConstants", "HypergeometricF", "Info", "IntegerFunctions", 
      "ISolve", "MakeReal", "MethodEGF", "MethodGF", "Methods", "Odd", 
      "PartialFractions", "PowerSum", "PrecisionHS", "PrecisionST", "RealQ", 
      "RSolve", "RSolveConstants", "SeriesTerm", "SpecialFunctions", 
      "UseApart", "UseMod"}]


(* Declarations for package DiscreteMath`Tree` *)

DeclarePackage["DiscreteMath`Tree`",
     {"ExprPlot", "MakeTree", "TreeFind", "TreePlot"}]


(* End of Master package *)

Null

