How to Install and Uninstall ocaml-ocamlgraph.i686 Package on Fedora 34
Last updated: November 29,2024
1. Install "ocaml-ocamlgraph.i686" package
Please follow the guidance below to install ocaml-ocamlgraph.i686 on Fedora 34
$
sudo dnf update
Copied
$
sudo dnf install
ocaml-ocamlgraph.i686
Copied
2. Uninstall "ocaml-ocamlgraph.i686" package
Here is a brief guide to show you how to uninstall ocaml-ocamlgraph.i686 on Fedora 34:
$
sudo dnf remove
ocaml-ocamlgraph.i686
Copied
$
sudo dnf autoremove
Copied
3. Information about the ocaml-ocamlgraph.i686 package on Fedora 34
Last metadata expiration check: 3:01:05 ago on Tue Sep 6 08:10:37 2022.
Available Packages
Name : ocaml-ocamlgraph
Version : 1.8.8
Release : 24.fc34
Architecture : i686
Size : 1.7 M
Source : ocaml-ocamlgraph-1.8.8-24.fc34.src.rpm
Repository : fedora
Summary : OCaml library for arc and node graphs
URL : http://ocamlgraph.lri.fr/index.en.html
License : LGPLv2 with exceptions
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 : 1.8.8
Release : 24.fc34
Architecture : i686
Size : 1.7 M
Source : ocaml-ocamlgraph-1.8.8-24.fc34.src.rpm
Repository : fedora
Summary : OCaml library for arc and node graphs
URL : http://ocamlgraph.lri.fr/index.en.html
License : LGPLv2 with exceptions
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.