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

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

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

(* :History: File created on 21 Feb. 1992 at 16:28 *)

(* Declarations for file DiscreteMath`CombinatorialFunctions` *)

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


(* Declarations for file DiscreteMath`Combinatorica` *)

DeclarePackage["DiscreteMath`Combinatorica`",
  {"AcyclicQ", "AddEdge", "AddVertex", "AllPairsShortestPath", 
   "ArticulationVertices", "Automorphisms", "Backtrack", 
   "BiconnectedComponents", "BiconnectedQ", "BinarySearch", "BinarySubsets", 
   "BipartiteMatching", "BipartiteQ", "BreadthFirstTraversal", "Bridges", 
   "CartesianProduct", "CatalanNumber", "ChangeEdges", "ChangeVertices", 
   "ChromaticNumber", "ChromaticPolynomial", "CirculantGraph", 
   "CircularVertices", "CliqueQ", "CodeToLabeledTree", "Cofactor", "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", 
   "Element", "EmptyGraph", "EmptyQ", "EncroachingListSet", 
   "EquivalenceClasses", "EquivalenceRelationQ", "Equivalences", "Eulerian", 
   "EulerianCycle", "EulerianQ", "ExactRandomGraph", "ExpandGraph", 
   "ExtractCycles", "FerrersDiagram", "FindCycle", "FindSet", 
   "FirstLexicographicTableau", "FromAdjacencyLists", "FromCycles", 
   "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", "K", "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", "Path", "PathConditionGraph", "PerfectQ", 
   "PermutationGroupQ", "PermutationQ", "Permute", "PlanarQ", "PointsAndLines", 
   "Polya", "PseudographQ", "RadialEmbedding", "Radius", "RandomComposition", 
   "RandomGraph", "RandomHeap", "RandomKSubset", "RandomPartition", 
   "RandomPermutation", "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", "ToCycles", "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 file DiscreteMath`ComputationalGeometry` *)

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


(* Declarations for file DiscreteMath`Permutations` *)

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


(* Declarations for file DiscreteMath`RSolve` *)

DeclarePackage["DiscreteMath`RSolve`",
  {"ArgPi", "ConjugateQ", "EGf", "Entails", "Even", 
   "ExponentialGeneratingFunction", "ExponentialPowerSum", "FactorialSimplify", 
   "FirstPos", "FreeL", "GeneratingFunction", "Gf", "HSolve", 
   "HypergeometricF", "ImP", "Info", "ISolve", "K", "LeadingCoef", 
   "ListComplement", "MakeList", "MakeReal", "MakeTrinomial", "MethodEGF", 
   "MethodGF", "Methods", "Odd", "PartialFractions", "PatternList", 
   "PoleMultiplicity", "PowerSum", "PrecisionHS", "PrecisionST", "RealQ", 
   "ReP", "Reset", "RSolve", "SafeFirst", "SafeSeries", "SeriesTerm", 
   "SimplifyComplexE1", "SimplifyComplexE2", "SimplifyComplexN", 
   "SimplifyComplex2", "SimplifyComplex3", "SimplifyComplex4", "SimplifySum", 
   "SimplifyTrig", "SpecialFunctions", "SymbolicMod", "TTQ", "UseApart", 
   "UseMod", "UserSymbols", "When"}]


(* Declarations for file DiscreteMath`Tree` *)

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


(* End of Master Package *)
