JGraphT—A Java Library for Graph Data Structures and Algorithms

@article{Michail2020JGraphTAJL,
  title={JGraphT—A Java Library for Graph Data Structures and Algorithms},
  author={D. Michail and J. Kinable and Barak Naveh and John V. Sichi},
  journal={ACM Transactions on Mathematical Software (TOMS)},
  year={2020},
  volume={46},
  pages={1 - 29}
}
  • D. Michail, J. Kinable, +1 author John V. Sichi
  • Published 2020
  • Mathematics, Computer Science
  • ACM Transactions on Mathematical Software (TOMS)
  • Mathematical software and graph-theoretical algorithmic packages to efficiently model, analyze, and query graphs are crucial in an era where large-scale spatial, societal, and economic network data are abundantly available. One such package is JGraphT, a programming library that contains very efficient and generic graph data structures along with a large collection of state-of-the-art algorithms. The library is written in Java with stability, interoperability, and performance in mind. A… CONTINUE READING

    Paper Mentions

    Organizing and compressing collections of files using differences
    Atomicity Checking in Linear Time using Vector Clocks
    1

    References

    Publications referenced by this paper.
    SHOWING 1-8 OF 8 REFERENCES
    LEDA: a platform for combinatorial and geometric computing
    1239
    SNAP: A General-Purpose Network Analysis and Graph-Mining Library
    452
    The Boost Graph Library - User Guide and Reference Manual
    691
    Blossom V: a new implementation of a minimum cost perfect matching algorithm
    296
    A computational comparison of the dinic and network simplex methods for maximum flow
    92
    Emergence of scaling in random networks
    27379
    One VM to rule them all
    213
    An Experimental Comparison of Max Flow Algorithms
    • 2014