Bijection.h File Reference

Utilities for working with the bijections between the edges incident to the two endpoints of a Pipe. More...

#include <ogdf/basic/Graph.h>
#include <ogdf/basic/GraphList.h>
#include <ogdf/basic/List.h>
#include <ogdf/basic/basic.h>
#include <ogdf/basic/comparer.h>
#include <ogdf/cluster/sync_plan/basic/Iterators.h>
#include <functional>
#include <utility>

Go to the source code of this file.

Namespaces
namespace	ogdf
	The namespace for all OGDF objects.
namespace	ogdf::sync_plan

Typedefs
using	ogdf::sync_plan::FrozenPipeBij = List< FrozenPipeBijPair >
using	ogdf::sync_plan::FrozenPipeBijPair = std::pair< int, int >
using	ogdf::sync_plan::PipeBij = List< PipeBijPair >
using	ogdf::sync_plan::PipeBijIterator = ZipIterator< ogdf::internal::GraphObjectContainer< AdjElement >::iterator, ogdf::internal::GraphObjectContainer< AdjElement >::reverse_iterator >
using	ogdf::sync_plan::PipeBijPair = std::pair< adjEntry, adjEntry >
using	ogdf::sync_plan::PipeBijRange = Range< PipeBijIterator >

Functions
void	ogdf::sync_plan::freezePipeBijection (const PipeBij &in, FrozenPipeBij &out)
void	ogdf::sync_plan::getFrozenPipeBijection (node u, node v, FrozenPipeBij &out)
PipeBijRange	ogdf::sync_plan::getPipeBijection (node u, node v)
void	ogdf::sync_plan::getPipeBijection (node u, node v, AdjEntryArray< adjEntry > &out)
void	ogdf::sync_plan::getPipeBijection (node u, node v, EdgeArray< edge > &out)
void	ogdf::sync_plan::getPipeBijection (node u, node v, PipeBij &out)
void	ogdf::sync_plan::join (Graph &G, node u, node v, sync_plan::PipeBij &bij, const std::function< void(node)> &deleteNode, const std::function< void(edge)> &deleteEdge, List< bool > *reverse_v=nullptr)
void	ogdf::sync_plan::join (Graph &G, node u, node v, sync_plan::PipeBij &bij, List< bool > *reverse_v=nullptr)
	ogdf::sync_plan::OGDF_DECLARE_COMPARER (FrozenPipeBijCmp, FrozenPipeBijPair, int, x.first)
	ogdf::sync_plan::OGDF_DECLARE_COMPARER (PipeBijCmp, PipeBijPair, int, x.first->theEdge() ->index())
std::pair< node, node >	ogdf::sync_plan::split (Graph &G, sync_plan::PipeBij &bij, const EdgeArray< edge > *new_edges=nullptr, const EdgeArray< bool > *reverse_edges=nullptr, node src=nullptr, node tgt=nullptr)

Detailed Description

Utilities for working with the bijections between the edges incident to the two endpoints of a Pipe.

Author

Simon D. Fink ogdf@.nosp@m.niko.nosp@m..fink.nosp@m..bay.nosp@m.ern

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 Bijection.h.