Traditionally, the way to represent a subset
of edges has been an array of booleans.
As there appear to be multiple subsets of edges,
an array of arrays of edges might be needed.
A path represented as a sequence of nodes is hard to exploain to a solver.
--
Michael
Hi!
I'm sorry if I was an inattentive reader, but the problem definition
does not seem to be clear for me. Please clarify, whether the graph is
always a tree or not. Your code for Edges seems to indicate otherwise,
so the further questions assume this:
- do you want to get all of the paths
Forwarded Message
Date: Sun, 2 Oct 2022 19:14:51 + (UTC)
Subject: Inquiry about using GNU MathProg
Cc: basma Mamdouh
To: help-glpk@gnu.org
From: basma mohamed
Dear GLPK developers and helpers,
After greeting,
I recently started to use lp_solve for optimizing the
