Showing 6 open source projects for "java swing components library"

View related business solutions
  • Paessler - Monitor Your Whole Network in Minutes Icon
    Paessler - Monitor Your Whole Network in Minutes

    Auto-discovery finds your devices and deploys pre-configured sensors instantly. No project plan required, just visibility from day one.

    Waiting weeks for a monitoring rollout isn't an option when infrastructure doesn't stop running. PRTG's auto-discovery scans your network and suggests from over 200 pre-configured sensor types, so you're watching servers, applications and devices within minutes, not after a multi-week deployment. Enterprise-strength monitoring, without the enterprise complexity. Start your free trial today.
    Start Free 30-Day Trial
  • Demo Series - Small Business Backup By Veeam Icon
    Demo Series - Small Business Backup By Veeam

    Learn how to protect your Microsoft 365 data, with simple, actionable tips today.

    Watch this on-demand demo series and learn how to protect your Microsoft 365 data with clear, simple, actionable steps that are easy to implement for businesses of all sizes.
    Watch Demo Series
  • 1

    Jadecy

    Java lib to compute (code) deps, SCCs, and cycles (Johnson algorithm).

    Jadecy (Java Dependencies and Cycles) is a Java library to compute dependencies (elements depended on, or depending), strongly connected components, and cycles, in general directed graphs, or classes or packages dependencies graphs parsed from class files (major version <= 52, else does best effort). It uses Tarjan's algorithm for SCCs computation, and Johnson's algorithm for exhaustive cycles computation, with continuations instead of recursion, which allows to handle large graphs (< 2^31 vertices). ...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 2
    How good is your software? jmove eases the understanding and valuation of the design and architecture of complex software written in java. It provides dependency analysis, metrics, design rule checking and impact analysis.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 3

    BPUtils

    Sterling Integrator BP utilities

    BPUtils is a Sterling Integrator BP file manipulation program. It features : - XPath expressions control : BPUtils checks that the XPath expressions defined in the BP file are correct - Consistency control : Controls that the sequences and the on faults are named in a correct way - Auto layout formatting : Formats automatically your BP layouts ! - BP tree printing : BPUtils is able to print to the console standard output the BP tree - BP dependencies analysis : Get the list...
    Downloads: 0 This Week
    Last Update:
    See Project
  • 4
    component-watch

    component-watch

    Describe and watch component structure of java programs

    "Component-Watch" is a tool discovering, showing and assessing the structure of (big) java programs from their classes. It finds what are the components composing a program, analyse what are the relations between those components and compare those the the permitted relations between components. The tool helps to easily define and display UML-like diagrams showing components and their relationship.
    Downloads: 0 This Week
    Last Update:
    See Project
  • $300 Free Credits to Build on Google Cloud Icon
    $300 Free Credits to Build on Google Cloud

    New customers can spin up VMs, build with AI, and query data at no cost.

    Put your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
    Start Free
  • 5

    JBVD

    Java Bytecode Viewer & Decompiler

    A very powerful java bytecode viewer and decompiler which makes use of the javassist open source library.
    Downloads: 0 This Week
    Last Update:
    See Project
  • 6

    JCycles

    [frozen] A library for computing cycles in graphs or in Java code.

    [This project is frozen, but has an offspring with more features: https://github.com/jeffhain/jadecy ] JCycles provides treatments to compute cycles, or just strongly connected components, in directed graphs in general, or in classes or packages dependencies graphs parsed from class files (major version <= 51, else does best effort). It uses Tarjan's algorithm for SCCs, and Johnson's for cycles, with continuations instead of recursion, which allows to handle large graphs (<...
    Downloads: 0 This Week
    Last Update:
    See Project
  • Previous
  • You're on page 1
  • Next