Open
Graph Drawing
Framework

  v. 2023.09 (Elderberry)
 
Overview Class Hierarchy Class Index Class List Members Namespaces Source Files

gen-acyclic-graph.cpp
Go to the documentation of this file.
1 #include <ogdf/basic/graph_generators.h>
2 #include <ogdf/layered/DfsAcyclicSubgraph.h>
3 #include <ogdf/fileformats/GraphIO.h>
4 
5 using namespace ogdf;
6 
7 int main()
8 {
9  Graph G;
10  randomSimpleGraph(G, 10, 20);
11 
12  DfsAcyclicSubgraph DAS;
13  DAS.callAndReverse(G);
14 
15  GraphIO::write(G, "output-acyclic-graph.gml", GraphIO::writeGML);
16 
17  return 0;
18 }
ogdf
The namespace for all OGDF objects.
Definition: AugmentationModule.h:36
graph_generators.h
Declaration of graph generators.
ogdf::GraphIO::write
static bool write(const Graph &G, const string &filename, WriterFunc writer=nullptr)
Writes graph G to a file with name filename and infers the format to use from the file's extension.
ogdf::GraphIO::writeGML
static bool writeGML(const Graph &G, std::ostream &os)
Writes graph G in GML format to output stream os.
GraphIO.h
Declares class GraphIO which provides access to all graph read and write functionality.
main
int main()
Definition: gen-acyclic-graph.cpp:7
ogdf::Graph
Data type for general directed graphs (adjacency list representation).
Definition: Graph_d.h:862
ogdf::DfsAcyclicSubgraph
DFS-based algorithm for computing a maximal acyclic subgraph.
Definition: DfsAcyclicSubgraph.h:43
DfsAcyclicSubgraph.h
Declaration of class DfsAcyclicSubgraph.
ogdf::AcyclicSubgraphModule::callAndReverse
void callAndReverse(Graph &G, List< edge > &reversed)
Makes G acyclic by reversing edges.
ogdf::randomSimpleGraph
bool randomSimpleGraph(Graph &G, int n, int m)
Creates a random simple graph.