How to Install and Uninstall ocaml-ocamlgraph.i686 Package on Fedora 38
Last updated: November 27,2024
1. Install "ocaml-ocamlgraph.i686" package
This is a short guide on how to install ocaml-ocamlgraph.i686 on Fedora 38
$
sudo dnf update
Copied
$
sudo dnf install
ocaml-ocamlgraph.i686
Copied
2. Uninstall "ocaml-ocamlgraph.i686" package
Please follow the guidelines below to uninstall ocaml-ocamlgraph.i686 on Fedora 38:
$
sudo dnf remove
ocaml-ocamlgraph.i686
Copied
$
sudo dnf autoremove
Copied
3. Information about the ocaml-ocamlgraph.i686 package on Fedora 38
Last metadata expiration check: 4:28:24 ago on Sat Mar 16 22:59:57 2024.
Available Packages
Name : ocaml-ocamlgraph
Version : 2.0.0
Release : 11.fc38
Architecture : i686
Size : 2.0 M
Source : ocaml-ocamlgraph-2.0.0-11.fc38.src.rpm
Repository : fedora
Summary : OCaml library for arc and node graphs
URL : https://backtracking.github.io/ocamlgraph/
License : LGPL-2.1-only WITH OCaml-LGPL-linking-exception
Description : Ocamlgraph provides several different implementations of graph data
: structures. It also provides implementations for a number of classical
: graph algorithms like Kruskal's algorithm for MSTs, topological
: ordering of DAGs, Dijkstra's shortest paths algorithm, and
: Ford-Fulkerson's maximal-flow algorithm to name a few. The algorithms
: and data structures are written functorially for maximal
: reusability. Also has input and output capability for Graph Modeling
: Language file format and Dot and Neato graphviz (graph visualization)
: tools.
Available Packages
Name : ocaml-ocamlgraph
Version : 2.0.0
Release : 11.fc38
Architecture : i686
Size : 2.0 M
Source : ocaml-ocamlgraph-2.0.0-11.fc38.src.rpm
Repository : fedora
Summary : OCaml library for arc and node graphs
URL : https://backtracking.github.io/ocamlgraph/
License : LGPL-2.1-only WITH OCaml-LGPL-linking-exception
Description : Ocamlgraph provides several different implementations of graph data
: structures. It also provides implementations for a number of classical
: graph algorithms like Kruskal's algorithm for MSTs, topological
: ordering of DAGs, Dijkstra's shortest paths algorithm, and
: Ford-Fulkerson's maximal-flow algorithm to name a few. The algorithms
: and data structures are written functorially for maximal
: reusability. Also has input and output capability for Graph Modeling
: Language file format and Dot and Neato graphviz (graph visualization)
: tools.