COIN-OR::LEMON - Graph Library

Changes in / [1150:df2d4bf31fcb:1154:9b4503108cc0] in lemon-main


Ignore:
Files:
3 edited

Legend:

Unmodified
Added
Removed
  • doc/groups.dox

    r1142 r1152  
    586586node labelings \f$l_1:V_1\longrightarrow L\f$ and \f$l_2:V_2\longrightarrow
    587587L\f$ and we require that \f$l_1(u)=l_2(f(u))\f$ holds for all nodes \f$u \in
    588 G\f$.
     588G_1\f$.
    589589
    590590*/
  • doc/references.bib

    r1142 r1153  
    357357
    358358@article{cordella2004sub,
    359   title =        {A (sub) graph isomorphism algorithm for matching
     359  author =       {Cordella, Luigi P. and Foggia, Pasquale and Sansone,
     360                  Carlo and Vento, Mario},
     361  title =        {A (sub)graph isomorphism algorithm for matching
    360362                  large graphs},
    361   author =       {Cordella, Luigi P and Foggia, Pasquale and Sansone,
    362                   Carlo and Vento, Mario},
    363   journal =      {Pattern Analysis and Machine Intelligence, IEEE
    364                   Transactions on},
    365   volume =       26,
    366   number =       10,
    367   pages =        {1367--1372},
    368   year =         2004,
    369   publisher =    {IEEE}
    370 }
     363  journal =      {IEEE Transactions on Pattern Analysis and Machine
     364                  Intelligence},
     365  volume =       26,
     366  number =       10,
     367  pages =        {1367--1372},
     368  year =         2004
     369}
  • lemon/vf2.h

    r1144 r1152  
    429429    void mappingType(Vf2MappingType m_type) { _mapping_type = m_type; }
    430430
    431     ///Find a mapping
     431    ///Finds a mapping
    432432
    433433    ///It finds a mapping between from g1 into g2 according to the mapping
Note: See TracChangeset for help on using the changeset viewer.