Stack Overflow
Stack Overflow

Questions tagged [lemon-graph-library]

A C++ template library for efficient implementations of data structures for optimization of tasks connected via graphs.

LEMON stands for Library for Efficient Modeling and Optimization in Networks. It is a C++ template library providing efficient implementations of common data structures and algorithms with focus on combinatorial optimization tasks connected mainly with graphs and networks.

LEMON employs genericity in C++ by using templates. The tools of the library are designed to be versatile, convenient and highly efficient. They can be combined easily to solve complex real-life optimization problems. For example, LEMON’s graphs can differ in many ways (depending on the representation and other specialities), but all have to satisfy one or more graph concepts, which are standardized interfaces to work with the rest of the library.

Useful links:

49 questions
39
votes
6 answers

CMake Error: TARGETS given no LIBRARY DESTINATION for shared library target

When building an opensource project with CMake (in my case, it was the lemon graph library), I got this error when I tried to build shared libaries via -DBUILD_SHARED_LIBS=1: TARGETS given no LIBRARY DESTINATION for shared library target Where does…
Stuart Berg
  • 17,026
  • 12
  • 67
  • 99
8
votes
2 answers

Why do C++ data structures for graphs hide contiguous integer indices?

Data structures for directed and undirected graphs are of fundamental importance. Well-known and widely-used implementations such as the Boost Graph Library and Lemon are designed such that the contiguous integer indices of nodes and edges are not…
Max Flow
  • 607
  • 7
  • 15
5
votes
1 answer

How to find the neighbours of a node in Lemon

In the Lemon C++ Graph Library, given a node in an undirected graph say, how does one find other nodes that are edge connected?
zenna
  • 9,006
  • 12
  • 73
  • 101
4
votes
1 answer

Methods for implementing and using graphs of nodes in C++?

I am working on a research project that deals with social networks. I have done most of the backbone of the program in C++ and am now wanting to implement a way to create the graph of nodes and the connections as well as a way to visualize the…
patemotter
  • 1,043
  • 1
  • 11
  • 19
4
votes
2 answers

Initialising shared_ptr , when the object requires a default constructor

For assigning shared_ptr to a Graph type variable in lemon graph library i did this: typedef ListDigraph Graph; typedef std::shared_ptr Process_pointer; Process_pointer process(new Graph); It worked fine, but now i need to declare a…
vigenere
  • 197
  • 3
  • 15
4
votes
0 answers

auto coords in lemon .eps exporting

In Lemon tutorial all examples specify coords when drawing graph: graphToEps(g,"graph_to_eps_demo_out_1_pure.eps"). coords(coords). title("Sample .eps figure"). copyright("(C) 2003-2009 LEMON Project"). run(); Is there any…
remdezx
  • 2,939
  • 28
  • 49
3
votes
2 answers

Lemon Graph Library on R using Rcpp

I think that this answer is a bit complex because it involves several things. I want to do high performance computations with R particularly with graphs (networks). As a R package igraph is very nice. But R is slow, so I want to code the…
J.I.Perotti
  • 61
  • 4
3
votes
1 answer

C++ graph with removable nodes, accessible properties and reliable IDs

I'm trying to migrate from a proprietary graph library to an Open Source one. EDIT: since so few people seem to know how Boost Graph actually works, if you can provide a solution using the LEMON Graph Library, that's fine too. Currently, my vertices…
Agostino
  • 2,723
  • 9
  • 48
  • 65
3
votes
2 answers

Finding the Nodes of an Edge in LEMON graph library

Suppose that I have an Edge. How can I easily find which two nodes it connects? The documentation of LEMON is so sparse, I could not find info on this.
szali
  • 498
  • 3
  • 11
3
votes
1 answer

Lemon Graph Library C++ - addNode using loop

Is there a possibility to create a lemon graph using a loop in C++? My Problem: A database table (let's call it t_nodes) with column: node A database table (let's call it t_edges) with graph information: node1 | node2 | edgeScore More than 10000…
xeroxed_yeti
  • 85
  • 1
  • 7
2
votes
0 answers

BOOST min-cut/max-flow on undirected graph with source and target

Can I use any algorithms from Boost on an undirected graph which must have a source and target (two nodes which must be in separate cuts). The preflow_relabel says it requires a directed graph. Stoer_wagner_min_cut says it works on undirected…
kreitz
  • 58
  • 6
2
votes
2 answers

lemon install SOPLEX, COIN and ILOG libraries

I was trying to install Lemon on Ubuntu 14.04. I was going as per the instructions in their documentation. On the "cmake .." command, I got an error as the following aniket@aniket-Lenovo-G50-45:~/lemon-1.3.1/build$ cmake .. CMake Error at…
Nicky Noah
  • 21
  • 4
2
votes
1 answer

"no viable conversion" with lemon for clang but valid for g++

Currently, I try to incorporate lemon library in our project. Most developers are on Windows, they compile with MSVC, but I am in charge (for this part) to compile with gcc and clang. I came across an error with clang that gcc does not reproduce and…
Isammoc
  • 883
  • 5
  • 20
2
votes
1 answer

How to get a node with index n in Lemon Graph Library?

When I build a graph g with this code: ListDigraph g; for (int i = 0; i < 7; ++i) g.addNode(); its nodes will have indexes {0..6}, which I tested by calling g.id() on them. How can I get a node by using its index? For example, I would like to…
Paul Jurczak
  • 7,008
  • 3
  • 47
  • 72
2
votes
1 answer

How to use GML files in Lemon?

I have a lot of topologies in GML format and want to process them with Lemon (http://lemon.cs.elte.hu/trac/lemon), but it doesn't support GML files. Is there a library?
Andras Balázs Lajtha
  • 2,576
  • 25
  • 32
1
2 3 4