Loading...

Searching...

No Matches

MaxAdjOrdering.h File Reference

Calculate one or all Maximum Adjacency Ordering(s) of a given simple undirected graph. More...

`#include <ogdf/basic/AdjacencyOracle.h>`

`#include <ogdf/basic/Graph.h>`

`#include <ogdf/basic/GraphAttributes.h>`

`#include <ogdf/basic/basic.h>`

`#include <ogdf/basic/geometry.h>`

`#include <ogdf/basic/graphics.h>`

`#include <ogdf/misclayout/LinearLayout.h>`

Go to the source code of this file.

## Classes | |

class | ogdf::MaxAdjOrdering |

Calculate one or all Maximum Adjacency Ordering(s) of a given simple undirected graph. More... | |

## Namespaces | |

namespace | ogdf |

The namespace for all OGDF objects. | |

Calculate one or all Maximum Adjacency Ordering(s) of a given simple undirected graph.

- License:
- This file is part of the Open Graph Drawing Framework (OGDF).

- Copyright (C)

See README.md in the OGDF root directory for details.

- This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License Version 2 or 3 as published by the Free Software Foundation; see the file LICENSE.txt included in the packaging of this file for details.

- This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.

- You should have received a copy of the GNU General Public License along with this program; if not, see http://www.gnu.org/copyleft/gpl.html

Definition in file MaxAdjOrdering.h.