Bellman-Ford-Algorithm

KO | EN

gitlite — search

#hacktoberfest #ai #golang #rust #deep-learning #linux #docker #nodejs #java #windows #cli #awesome-list #ios #mcp

Bellman-Ford-Algorithm

(★ 3)

Program to calculate graphs distance using Bellman-Ford Algorithm

Bellman-Ford-Algorithm 최신버젼 다운로드

최종 버전 다운로드 (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# Bellman-Ford Algorithm <img align="center" alt="Java" height="45" width="55" src="https://cdn.jsdelivr.net/gh/devicons/devicon@latest/icons/java/java-original.svg" />

<h3>Description</h3>
This project implements the Bellman-Ford Algorithm in Java to find the shortest paths from a source vertex to all other vertices in a directed graph, even when negative weights are present.

<h3>Features</h3>
<table>
  <tr>
    - Allows the user to input the number of vertices and edges.
  </tr>
  <br>
  <tr>
    - Detects and prevents invalid inputs (e.g., non-existent vertices).
  </tr>
  <br>
  <tr>
    - Runs the Bellman-Ford Algorithm and displays the shortest distances.
  </tr>
  <br>
  <tr>
    - Detects negative-weight cycles, notifying the user when one is found.
  </tr>
  <br>
</table>

<h3>How to run</h3>
<table>
  <tr>
    - Clone the project to your computer using the command:<dt>

git clone https://github.com/paulo-campos-57/Bellman-Ford-Algorithm.git
  </dt>
  </tr>
  <tr>
    - Compile the project using the command:<dt>

javac -d bin src/com/example/resources/*.java
  </dt>
  </tr>
  <tr>
    - Run the program using the command:<dt>

java -cp bin com.example.resources.Main
  </dt>
  </tr>
</table>
<h3>Developers</h3>
<table>
  <tr>
    <td align="center">
      <a href="https://github.com/grossiter04">
        <img src="https://avatars.githubusercontent.com/u/116268469?v=4" width="100px;" alt="Foto Rossiter"/><br>
        <sub>
          <b>Gabriel Rossiter</b>
        </sub>
      </a>      
      <br>
      <sub>gsr@cesar.school</sub>
    </td>
    <td align="center">
      <a href="https://github.com/paulo-campos-57">
        <img src="https://avatars.githubusercontent.com/u/77108503?v=4" width="100px;" alt="Foto Megas"/><br>
        <sub>
          <b>Paulo Campos</b>
        </sub>
      </a>
      <br>
      <sub>pmc3@cesar.school</sub>
    </td>
  </tr>
</table>

# Bellman-Ford Algorithm <img align="center" alt="Java" height="45" width="55" src="https://cdn.jsdelivr.net/gh/devicons/devicon@latest/icons/java/java-original.svg" />

<h3>Descrição</h3>
Este projeto implementa o Algoritmo de Bellman-Ford em Java para encontrar as menores distâncias de um vértice de origem para todos os outros vértices em um grafo dirigido, mesmo quando há pesos negativos.

<h3>Features</h3>
<table>
  <tr>
    - Permite que o usuário insira a quantidade de vértices e arestas do grafo.
  </tr>
  <br>
  <tr>
    - Detecta e evita entradas inválidas (ex: vértices inexistentes).
  </tr>
  <br>
  <tr>
    - Executa o Algoritmo de Bellman-Ford e exibe as distâncias mínimas.
  </tr>
  <br>
  <tr>
    - Detecta ciclos negativos, informando ao usuário quando um ciclo desse tipo está presente.
  </tr>
  <br>
</table>

<h3>Como rodar</h3>
<table>
  <tr>
    - Clone em sua máquina usando o comando:<dt>

git clone https://github.com/paulo-campos-57/Bellman-Ford-Algorithm.git
  </dt>
  </tr>
  <tr>
    - Compile o projeto usando o comando:<dt>

javac -d bin src/com/example/resources/*.java
  </dt>
  </tr>
  <tr>
    - Rode o programa usando o comando:<dt>

java -cp bin com.example.resources.Main
  </dt>
  </tr>
</table>
<h3>Desenvolvedores</h3>
<table>
  <tr>
    <td align="center">
      <a href="https://github.com/grossiter04">
        <img src="https://avatars.githubusercontent.com/u/116268469?v=4" width="100px;" alt="Foto Rossiter"/><br>
        <sub>
          <b>Gabriel Rossiter</b>
        </sub>
      </a>      
      <br>
      <sub>gsr@cesar.school</sub>
    </td>
    <td align="center">
      <a href="https://github.com/paulo-campos-57">
        <img src="https://avatars.githubusercontent.com/u/77108503?v=4" width="100px;" alt="Foto Megas"/><br>
        <sub>
          <b>Paulo Campos</b>
        </sub>
      </a>
      <br>
      <sub>pmc3@cesar.school</sub>
    </td>
  </tr>
</table>

Bellman-Ford-Algorithm

Bellman-Ford-Algorithm 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

Bellman-Ford-Algorithm

Bellman-Ford-Algorithm 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

Download README