mirror of
https://github.com/revng/revng
synced 2026-06-21 14:07:57 +00:00
Ivan Krysak
44 lines
1.1 KiB
C++
44 lines
1.1 KiB
C++
#pragma once
|
|
|
|
//
|
|
// This file is distributed under the MIT License. See LICENSE.md for details.
|
|
//
|
|
|
|
#include "revng/Yield/ControlFlow/Configuration.h"
|
|
#include "revng/Yield/Graph.h"
|
|
|
|
namespace yield::sugiyama {
|
|
|
|
enum class RankingStrategy {
|
|
BreadthFirstSearch,
|
|
DepthFirstSearch,
|
|
Topological,
|
|
DisjointDepthFirstSearch
|
|
};
|
|
|
|
struct Configuration {
|
|
public:
|
|
RankingStrategy Ranking;
|
|
bool UseOrthogonalBends;
|
|
|
|
Graph::Dimension NodeMarginSize;
|
|
Graph::Dimension EdgeMarginSize;
|
|
};
|
|
|
|
/// A custom graph layering algorithm designed for pre-calculating majority of
|
|
/// the expensive stuff needed for graph rendering.
|
|
bool layout(Graph &Graph, const Configuration &Configuration);
|
|
|
|
inline bool
|
|
layout(Graph &Graph,
|
|
const cfg::Configuration &CFG,
|
|
RankingStrategy Ranking = RankingStrategy::DisjointDepthFirstSearch) {
|
|
return layout(Graph,
|
|
Configuration{ .Ranking = Ranking,
|
|
.UseOrthogonalBends = CFG.UseOrthogonalBends,
|
|
.NodeMarginSize = CFG.ExternalNodeMarginSize,
|
|
.EdgeMarginSize = CFG.EdgeMarginSize });
|
|
}
|
|
|
|
} // namespace yield::sugiyama
|