A library for performing graph drawing calculations:
- Layer assignment and nesting
- Normalization
- Crossing reduction
- Positioning of nodes and edges
If available in Hex, the package can be installed
by adding graph
to your list of dependencies in mix.exs
:
def deps do
[
{:graph, "~> 0.1.0"}
]
end
Documentation can be generated with ExDoc and published on HexDocs. Once published, the docs can be found at https://hexdocs.pm/graph.
- dagrejs/dagre, directed graph layout for JavaScript
- libgraph, a graph data structure library for Elixir projects
- Erlang OTP's digraph and digrap_utils modules
- OGDF, the Open Graph Drawing Framework C++ library
- Graphviz, an open source graph visualization software
- Sander, G. (1996). Layout of compound directed graphs.
- Forster, M. (2002) Applying Crossing Reduction Strategies to Layered Compound Graphs. In: Goodrich M.T., Kobourov S.G. (eds) Graph Drawing. GD 2002. Lecture Notes in Computer Science, vol 2528. Springer, Berlin, Heidelberg
- Forster, M. (2004). A fast and simple heuristic for constrained two-level crossing reduction. In International Symposium on Graph Drawing (pp. 206-216). Springer, Berlin, Heidelberg.
- Forster, M. (2005). Crossings in clustered level graphs.