COIN-OR::LEMON - Graph Library

Custom Query (512 matches)


Show under each result:

Results (1 - 3 of 512)

1 2 3 4 5 6 7 8 9 10 11
Ticket Resolution Summary Owner Reporter
#624 spam PBX Technician Alpar Juttner pavania

PBX (Telephone and Private Branch Exchange) Technicians are trained professionals who provide maintenance, installation, repair and setup of multi-line TDM- and IP-based business voice and computing systems.

Nowadays PBX technology has turned into one of the most extensively used telephony systems by Business Organizations. The market acceptance of PBX phone setup due to the flexibility of their usage and the significant improvement has gone up. It has made corporate communications much more comfortable for customers. Moreover, PBX technicians help in setting up the telephony technique as per business requirements.

Technicians resolve cabling issues, repair switch equipment, test and install VoIP networks and interchange analog phone systems with digital equipment. They also help to resolve customer issues, to provide better customer experiences systematically.

PBX Service Technicians are one of the prime categories of telephone company workforce. Technicians fixe and install telephone lines and small switchboard systems at customers' buildings and offices. Working from trucks that carry the tools they require, these technicians devote much of their time traveling from one place to another. Although many Service Technicians do a variety of work, most specialize in one type of work.

Know more:

#623 fixed Different ids assigned to the same edge in an undirected graph Alpar Juttner Francesco

Dear LEMON developers, I would like to report a problem regarding multiple ids associated with the same edge in an undirected graph. Let us consider the following code in which I define a complete undirected graph with 3 nodes:

#include <iostream>
#include <lemon/list_graph.h>

using lemon::INVALID;
using namespace std;

int main() {

    lemon::ListGraph g;
    for(int i=0;i<3;i++){
    for(int i=0;i<3;i++){
        for(int j=0;j<3;j++){

    cout<<"Edge of the graph: "<<endl;
    for(lemon::ListGraph::EdgeIt e(g); e!=INVALID;++e){
        cout<<"Edge {"<<<<","<<<<"}: id= "<< << endl;

    cout<<"IncEdge of the graph: "<<endl;
    for(lemon::ListGraph::NodeIt i(g); i!=INVALID; ++i){
        for(lemon::ListGraph::IncEdgeIt e(g, i); e != INVALID; ++e)
            cout<<"Edge {"<<<<","<<<<"}: id= "<<<<endl;

Notice that I ask to print the id in two different ways: by iterating on all the edges of the graph and by iterating on the nodes of the graph and, for each node, by considering its incident edges. The output of the previous code is:

Edge of the graph: Edge {1,2}: id= 2 Edge {0,2}: id= 1 Edge {0,1}: id= 0

IncEdge? of the graph: Edge {2,1}: id= 4 Edge {2,0}: id= 2 Edge {1,2}: id= 5 Edge {1,0}: id= 0 Edge {0,2}: id= 3 Edge {0,1}: id= 1

You can notice that to the edge {0,1} are assigned the id 0 (loop on the edges) and 1 (loop on the incident edges).

#619 invalid Segmentation fault when calling findArc Alpar Juttner didif

Found in version: 1.3.1

The call to findArc in the bellow program yields segmentation fault on Ubuntu 16.04:

int main() {

ListGraph? g; ListGraph::Node n = g.addNode(); ListGraph::Arc a = findArc(g, INVALID, n); return 0;


I expect to get INVALID back from findArc in this case.

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