Here is a list of all documented class members with links to the class documentation for each member:

- n -

• NagamochiIbaraki() : NagamochiIbaraki< GR, CM, TR >
• NaN : LpBase
• NEAREST : InsertionTsp< CM >
• NearestNeighborTsp() : NearestNeighborTsp< CM >
• negateY() : GraphToEps< T >
• negative() : Tolerance< float > , Tolerance< double > , Tolerance< long double > , Tolerance< T >
• negativeCycle() : BellmanFord< GR, LEN, TR >
• negMap() : NegMap< M >
• NegMap() : NegMap< M >
• NegWriteMap() : NegWriteMap< M >
• negWriteMap() : NegWriteMap< M >
• NetworkSimplex() : NetworkSimplex< GR, V, C >
• newSolver() : CbcMip , ClpLp , CplexLp , CplexMip , GlpkLp , LpSolver , MipSolver , LpSkeleton , MipSkeleton , SoplexLp
• next() : IterableBpGraphComponent< BAS > , PlanarEmbedding< Graph > , IterableDigraphComponent< BAS > , IterableGraphComponent< BAS > , IterableBpGraphComponent< BAS >
• nextArc() : Dfs< GR, TR > , DfsVisit< GR, VS, TR >
• nextIn() : IterableDigraphComponent< BAS >
• nextInc() : IterableGraphComponent< BAS >
• nextNode() : Bfs< GR, TR > , BfsVisit< GR, VS, TR > , Dijkstra< GR, LEN, TR > , MaxCardinalitySearch< GR, CAP, TR >
• nextOut() : IterableDigraphComponent< BAS >
• NO_CYCLE : HowardMmc< GR, CM, TR >
• node() : DigraphCopy< From, To > , GraphCopy< From, To > , BpGraphCopy< From, To > , DigraphReader< DGR > , GraphReader< GR > , BpGraphReader< BGR > , DigraphWriter< DGR > , GraphWriter< GR > , BpGraphWriter< BGR > , StaticDigraph
• Node : BaseDigraphComponent , BpGraph::Node , Digraph::Node , Graph::Node
• nodeColors() : GraphToEps< T >
• nodeCrossRef() : DigraphCopy< From, To > , GraphCopy< From, To > , BpGraphCopy< From, To >
• NodeFilterMap : SubDigraph< DGR, NF, AF > , SubGraph< GR, NF, EF >
• nodeFromId() : BpGraph , Digraph , Graph , IDableDigraphComponent< BAS >
• NodeIt : IterableDigraphComponent< BAS > , BpGraph::NodeIt , Digraph::NodeIt , Graph::NodeIt
• nodeMap() : DigraphWriter< DGR > , BpGraphCopy< From, To > , GraphReader< GR >
• NodeMap() : Graph::NodeMap< T > , BpGraph::NodeMap< T > , Digraph::NodeMap< T > , Graph::NodeMap< T > , MappableDigraphComponent< BAS >::NodeMap< V >
• nodeMap() : DigraphCopy< From, To > , GraphCopy< From, To > , DigraphReader< DGR > , GraphReader< GR > , BpGraphReader< BGR > , DigraphWriter< DGR > , GraphWriter< GR > , BpGraphWriter< BGR >
• nodeMapNames() : LgfContents
• NodeNotifier : AlterableDigraphComponent< BAS >
• nodeNum() : StaticDigraph , HypercubeGraph , DimacsDescriptor , FullDigraph , FullGraph , FullBpGraph
• nodePsTexts() : GraphToEps< T >
• nodePsTextsPreamble() : GraphToEps< T >
• nodeRef() : BpGraphCopy< From, To > , DigraphCopy< From, To > , GraphCopy< From, To >
• nodes() : DigraphReader< DGR > , GraphReader< GR > , GraphWriter< GR > , BpGraphReader< BGR > , BpGraphWriter< BGR > , DigraphWriter< DGR >
• nodeScale() : GraphToEps< T >
• nodeSection() : LgfContents
• nodeSectionNum() : LgfContents
• nodeShapes() : GraphToEps< T >
• NodeShapes : GraphToEps< T >
• nodeSizes() : GraphToEps< T >
• nodeTextColors() : GraphToEps< T >
• nodeTexts() : GraphToEps< T >
• nodeTextSize() : GraphToEps< T >
• nodeValue() : MaxWeightedFractionalMatching< GR, WM > , MaxWeightedPerfectMatching< GR, WM > , MaxWeightedPerfectFractionalMatching< GR, WM > , MaxWeightedMatching< GR, WM >
• NONE : DimacsDescriptor
• nonZero() : Tolerance< long double > , Tolerance< double > , Tolerance< T > , Tolerance< float >
• NORMAL : TimeStamp
• normSquare() : Point< T >
• normSquareMap() : NormSquareMap< M >
• NormSquareMap() : NormSquareMap< M >
• NoSubCounter : Counter
• notifier() : AlterableDigraphComponent< BAS > , AlterableBpGraphComponent< BAS > , AlterableGraphComponent< BAS > , AlterableDigraphComponent< BAS > , AlterableBpGraphComponent< BAS >
• NoTimeReport() : NoTimeReport
• NotMap() : NotMap< M >
• notMap() : NotMap< M >
• notWriteMap() : NotWriteMap< M >
• NotWriteMap() : NotWriteMap< M >
• nth() : ListPath< GR > , Path< GR > , SimplePath< GR > , StaticPath< GR >
• nthIt() : Path< GR > , StaticPath< GR > , SimplePath< GR > , ListPath< GR >
• nullMap() : NullMap< K, V >