COIN-OR::LEMON - Graph Library

Custom Query (512 matches)

Filters
 
Or
 
  
 
Columns

Show under each result:


Results (4 - 6 of 512)

1 2 3 4 5 6 7 8 9 10 11 12
Ticket Resolution Summary Owner Reporter
#515 spam root lg g2 kitkat Alpar Juttner AnnaKite
Description

As it happens, the device with the model number LG-D260 has just passed through Bluetooth SIG, and the device is rumored, LG G2 Mini. Visiting the Bluetooth SIG, it usually means that the phone is only a few weeks away from launch, so we did not have to wait long to see what the G2 Mini has to offer.

While G2 LG was the absolute number of the beast, we did not expect that G2 Mini to be a strong performer. It is rumored that Mini G2 will have a QHD display, which means 540 to 960 - pathetic by today's standards. However, we do not know how big the display is physically or as a "mini" pipe. These days, 4.5 "screens posing as a" mini ", which is a bit crazy.

On a positive note, although it is expected, LG G2 Mini is rumored to launch with Android 4.4 KitKat?, which is a pleasant surprise. Almost all devices LG behind in terms of updates Android, so that's very positive. Of course, there is no word from LG, but we'll let you know if we hear anything. At the same time, let us know if the "mini" phone that you would buy!

There's something to say about the meaning of the word "mini" when a 4.7-inch devices fit into this bootloader category in this day and age. This is exactly what the LG G2 Mini is, nevertheless, with the LG announces its existence ahead of Mobile World Congress.

#356 fixed MaxWeightedPerfectMatching re-run crash Balazs Dezso Ben Strasser
Description

Hello,

when calling run a second time after changing the referenced graph and weights the matching function may crash.

Graph g;
Graph::EdgeMap<int>w(g);
// fill g and w
MaxWeightedPerfectMatching<Graph> mm(g, w);
mm.run();
// modify g and w
mm.run();
for(EdgeIt i(g);i!=INVALID; ++i)
  mm.matching(i); // This can crash here

Version is the 1.1.2 Download from the main site.

#369 invalid graphCopy crash Peter Kovacs Ben Strasser
Description

The following code crashes:

#include <lemon/list_graph.h>
#include <lemon/core.h>
#include <lemon/lgf_reader.h>

typedef lemon::ListGraph Graph;
using lemon::INVALID;
	
int main(int argc, char*argv[]){
	Graph g;

	lemon::GraphReader<Graph>(g, "bug")
		.run();

	bool a = true;
	for(Graph::EdgeIt i(g); i!=INVALID;){
		Graph::Edge e = i;
		++i;
		if(a)
			g.erase(e);
		a = !a;
	}

	Graph g2;
	Graph::EdgeMap<Graph::Edge>edge_map(g2);

	lemon::graphCopy(g, g2)
		.edgeRef(edge_map)
		.run();
}

I have attached the graph in the bug file. The problem is in graphCopy because the following code works

#include <lemon/list_graph.h>
#include <lemon/core.h>
#include <lemon/lgf_reader.h>

typedef lemon::ListGraph Graph;
using lemon::INVALID;
	
int main(int argc, char*argv[]){
	Graph g;

	lemon::GraphReader<Graph>(g, "bug")
		.run();

	bool a = true;
	for(Graph::EdgeIt i(g); i!=INVALID;){
		Graph::Edge e = i;
		++i;
		if(a)
			g.erase(e);
		a = !a;
	}

	Graph g2;
	Graph::EdgeMap<Graph::Edge>edge_map(g2);

	Graph::NodeMap<Graph::Node>node_map(g);
	for(Graph::NodeIt i(g); i!=INVALID; ++i){
		Graph::Node u = g2.addNode();
		node_map[i] = u;
	}
		
	for(Graph::EdgeIt i(g); i!=INVALID; ++i){
		edge_map[
			g2.addEdge(
				node_map[g.u(i)],
				node_map[g.v(i)]
			)
		] = i;
	}

	/*lemon::graphCopy(g, g2)
		.edgeRef(edge_map)
		.run();*/
}

My version is according to lemon/config.h

#define LEMON_VERSION 1.1.1

It's one of the stable releases. It's not an svn version.

Thanks for looking into this.

1 2 3 4 5 6 7 8 9 10 11 12
Note: See TracQuery for help on using queries.