Skip to content
Open
Show file tree
Hide file tree
Changes from 16 commits
Commits
Show all changes
51 commits
Select commit Hold shift + click to select a range
7070d74
Setting up GitHub Classroom Feedback
github-classroom[bot] May 14, 2024
bd706ef
Add structure of project on Gradle!!!
bikakuka May 14, 2024
e3d30d2
add in build.gradle.kts compose
bikakuka May 15, 2024
67d29bd
added a realization for graph, Directed graph and weighted graph class
bikakuka May 28, 2024
8dc4898
add spanning tree and StronglyConnectedComponents
oleg01228 May 29, 2024
8f3411f
minor fixes
oleg01228 May 29, 2024
89b6ab4
minor fixes
oleg01228 May 29, 2024
7275426
Implemented Dijkstra's algorithm to find the shortest path within a w…
SecretPersona5 May 29, 2024
db2dd5e
Implemented the 'Spring Embedder' graph layout algorithm on the plane
SecretPersona5 May 29, 2024
5eb2f0a
Implemented clusterization and search for communities in the graph
SecretPersona5 May 29, 2024
2d94706
Update Graph.kt
bikakuka May 29, 2024
a6303d3
Update WGraph.kt
bikakuka May 29, 2024
9661dd1
Merge pull request #2 from spbu-coding-2023/algos
bikakuka May 29, 2024
4ff7568
Update Main.kt
bikakuka May 29, 2024
16f0211
Forgot about images
bikakuka May 29, 2024
99a6ac4
Create README.md
SecretPersona5 May 29, 2024
6fe215e
add some test for algos
bikakuka Jun 1, 2024
d764c3d
Add test for some algos
bikakuka Jun 1, 2024
fafe97e
Merge pull request #3 from spbu-coding-2023/testBikakuka
bikakuka Jun 1, 2024
c1ffd83
Delete .idea directory
bikakuka Jun 1, 2024
b8640bb
Replace all debug prints to logs
bikakuka Jun 1, 2024
5a88684
Create LICENSE
bikakuka Jun 1, 2024
a3840c8
try to fix focus in windowDialog
bikakuka Jun 1, 2024
5063dce
fix focus in additional windows
bikakuka Jun 1, 2024
27700da
Add realization of deleting nodes
bikakuka Jun 1, 2024
5f4add3
Add saves for graphs in .JSON
bikakuka Jun 1, 2024
65545f4
Add comments to Main.kt
bikakuka Jul 16, 2024
27a4437
fix typo
bikakuka Jul 16, 2024
8b82cb9
Minor changes in codestyle. Changing icons in the application.
SecretPersona5 Sep 7, 2024
6f48627
Added cycle detection to GUI components
SecretPersona5 Sep 10, 2024
5beecea
Fix: Added icon color change to GUI when changing theme
SecretPersona5 Sep 10, 2024
e810d1f
fix: Correction of the algorithm for searching for cycles and bugs in…
SecretPersona5 Sep 17, 2024
27caeb0
Fix: changed tests for the current version of the algorithm
SecretPersona5 Sep 17, 2024
a17a3c9
Fix: I forgot to add the resources folder to the commit. I'm correcting
SecretPersona5 Sep 19, 2024
51cd327
Changes: Loading of saves has been added to the application.
SecretPersona5 Sep 20, 2024
35e97b5
Change: Updated tests for SCCs
SecretPersona5 Sep 20, 2024
5307b0a
Fix: now the cycle search algorithm works correctly.
SecretPersona5 Sep 20, 2024
0f21573
Changes: Added a graph selection window.
SecretPersona5 Sep 20, 2024
f9c828b
Changes: Removed temporary logging
SecretPersona5 Sep 20, 2024
6852c79
Fix: Repaired the tests (Fixed an error in creating the transposed gr…
SecretPersona5 Sep 20, 2024
d293e1b
Rewrote the search algorithm for strongly connected components. Now i…
SecretPersona5 Sep 23, 2024
841598c
Addition: Added an algorithm for selecting strongly connected compone…
SecretPersona5 Sep 23, 2024
b51e136
Addition: Wrote tests for algorithms: finding bridges, Dijkstra, grap…
SecretPersona5 Sep 23, 2024
629df4c
Merge pull request #4 from spbu-coding-2023/Branch_of_SecretPersona5
SecretPersona5 Sep 23, 2024
15f9339
Update README.md
SecretPersona5 Sep 23, 2024
8d3c4d8
Merge pull request #5 from spbu-coding-2023/Branch_of_SecretPersona5
SecretPersona5 Sep 23, 2024
ccf1965
Merge pull request #6 from spbu-coding-2023/Implementation-of-conserv…
SecretPersona5 Sep 24, 2024
6b0058e
Merge pull request #7 from spbu-coding-2023/Implementation-of-conserv…
SecretPersona5 Sep 24, 2024
2429c99
add louvain, spanning tree, tests for added algorithms, saving and lo…
oleg01228 Oct 28, 2024
36e31f5
little fixes
oleg01228 Oct 28, 2024
47bfc38
fixed typos
oleg01228 Oct 28, 2024
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
9 changes: 9 additions & 0 deletions .idea/graphs-graphss-14.iml

Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.

6 changes: 6 additions & 0 deletions .idea/misc.xml

Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.

8 changes: 8 additions & 0 deletions .idea/modules.xml

Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.

6 changes: 6 additions & 0 deletions .idea/vcs.xml

Some generated files are not rendered by default. Learn more about how customized files appear on GitHub.

25 changes: 25 additions & 0 deletions README.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,25 @@
## About the Application

Welcome to our Kotlin application, a comprehensive toolkit designed to facilitate the visualization, analysis, and storage of graph data. This application provides a user-friendly interface that empowers users to explore and manipulate graphs with ease.

## Key Features

- **Graph Plane Layout (Spring Embedder):** Efficiently arrange graph nodes for optimal visualization.
- **Highlighting Key Vertices:** Easily identify and emphasize critical nodes within the graph.
- **Search for Communities (Clustering):** Discover and group nodes into communities based on their connectivity.
- **Isolation of Strongly Connected Components:** Identify and isolate subgraphs where every node is reachable from every other node.
- **Finding Bridges:** Locate and highlight the edges that, when removed, would increase the number of disconnected components.
- **Search for Cycles for a Given Vertex:** Trace and visualize cycles originating from a specified vertex.
- **Constructing a Minimal Spanning Tree (SpanningTree STP):** Build a tree that spans all vertices with the minimum total edge weight.
- **Finding the Shortest Path (Dijkstra's Algorithm):** Determine the shortest path between two vertices using Dijkstra's algorithm.
- **Finding the Shortest Path (Ford-Bellman Algorithm):** Similarly, find the shortest path but with the Ford-Bellman algorithm.

## Important Notes

Please be aware that the following features are currently unavailable and have not been integrated into the current version of the application:

- **Search for Cycles for a Given Vertex**
- **Search for Communities (Clustering)**
- **Identification of Strong Connectivity Components**

We are actively working on these features and plan to include them in future updates.
26 changes: 26 additions & 0 deletions build.gradle.kts
Original file line number Diff line number Diff line change
@@ -0,0 +1,26 @@
plugins {
kotlin("jvm") version "1.9.22"
id("org.jetbrains.compose") version "1.6.2"
}

group = "org.example"
version = "1.0-SNAPSHOT"

repositories {
google()
mavenCentral()
maven("https://maven.pkg.jetbrains.space/public/p/compose/dev")
}

dependencies {
testImplementation(kotlin("test"))
implementation(compose.desktop.currentOs)
}

tasks.test {
useJUnitPlatform()
}

kotlin {
jvmToolchain(21)
}
1 change: 1 addition & 0 deletions gradle.properties
Original file line number Diff line number Diff line change
@@ -0,0 +1 @@
kotlin.code.style=official
Binary file added gradle/wrapper/gradle-wrapper.jar
Binary file not shown.
6 changes: 6 additions & 0 deletions gradle/wrapper/gradle-wrapper.properties
Original file line number Diff line number Diff line change
@@ -0,0 +1,6 @@
#Wed May 15 03:47:01 MSK 2024
distributionBase=GRADLE_USER_HOME
distributionPath=wrapper/dists
distributionUrl=https\://services.gradle.org/distributions/gradle-8.5-bin.zip
zipStoreBase=GRADLE_USER_HOME
zipStorePath=wrapper/dists
234 changes: 234 additions & 0 deletions gradlew
Original file line number Diff line number Diff line change
@@ -0,0 +1,234 @@
#!/bin/sh

#
# Copyright © 2015-2021 the original authors.
#
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
#
# https://www.apache.org/licenses/LICENSE-2.0
#
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
# See the License for the specific language governing permissions and
# limitations under the License.
#

##############################################################################
#
# Gradle start up script for POSIX generated by Gradle.
#
# Important for running:
#
# (1) You need a POSIX-compliant shell to run this script. If your /bin/sh is
# noncompliant, but you have some other compliant shell such as ksh or
# bash, then to run this script, type that shell name before the whole
# command line, like:
#
# ksh Gradle
#
# Busybox and similar reduced shells will NOT work, because this script
# requires all of these POSIX shell features:
# * functions;
# * expansions «$var», «${var}», «${var:-default}», «${var+SET}»,
# «${var#prefix}», «${var%suffix}», and «$( cmd )»;
# * compound commands having a testable exit status, especially «case»;
# * various built-in commands including «command», «set», and «ulimit».
#
# Important for patching:
#
# (2) This script targets any POSIX shell, so it avoids extensions provided
# by Bash, Ksh, etc; in particular arrays are avoided.
#
# The "traditional" practice of packing multiple parameters into a
# space-separated string is a well documented source of bugs and security
# problems, so this is (mostly) avoided, by progressively accumulating
# options in "$@", and eventually passing that to Java.
#
# Where the inherited environment variables (DEFAULT_JVM_OPTS, JAVA_OPTS,
# and GRADLE_OPTS) rely on word-splitting, this is performed explicitly;
# see the in-line comments for details.
#
# There are tweaks for specific operating systems such as AIX, CygWin,
# Darwin, MinGW, and NonStop.
#
# (3) This script is generated from the Groovy template
# https://github.com/gradle/gradle/blob/master/subprojects/plugins/src/main/resources/org/gradle/api/internal/plugins/unixStartScript.txt
# within the Gradle project.
#
# You can find Gradle at https://github.com/gradle/gradle/.
#
##############################################################################

# Attempt to set APP_HOME

# Resolve links: $0 may be a link
app_path=$0

# Need this for daisy-chained symlinks.
while
APP_HOME=${app_path%"${app_path##*/}"} # leaves a trailing /; empty if no leading path
[ -h "$app_path" ]
do
ls=$( ls -ld "$app_path" )
link=${ls#*' -> '}
case $link in #(
/*) app_path=$link ;; #(
*) app_path=$APP_HOME$link ;;
esac
done

APP_HOME=$( cd "${APP_HOME:-./}" && pwd -P ) || exit

APP_NAME="Gradle"
APP_BASE_NAME=${0##*/}

# Add default JVM options here. You can also use JAVA_OPTS and GRADLE_OPTS to pass JVM options to this script.
DEFAULT_JVM_OPTS='"-Xmx64m" "-Xms64m"'

# Use the maximum available, or set MAX_FD != -1 to use that value.
MAX_FD=maximum

warn () {
echo "$*"
} >&2

die () {
echo
echo "$*"
echo
exit 1
} >&2

# OS specific support (must be 'true' or 'false').
cygwin=false
msys=false
darwin=false
nonstop=false
case "$( uname )" in #(
CYGWIN* ) cygwin=true ;; #(
Darwin* ) darwin=true ;; #(
MSYS* | MINGW* ) msys=true ;; #(
NONSTOP* ) nonstop=true ;;
esac

CLASSPATH=$APP_HOME/gradle/wrapper/gradle-wrapper.jar


# Determine the Java command to use to start the JVM.
if [ -n "$JAVA_HOME" ] ; then
if [ -x "$JAVA_HOME/jre/sh/java" ] ; then
# IBM's JDK on AIX uses strange locations for the executables
JAVACMD=$JAVA_HOME/jre/sh/java
else
JAVACMD=$JAVA_HOME/bin/java
fi
if [ ! -x "$JAVACMD" ] ; then
die "ERROR: JAVA_HOME is set to an invalid directory: $JAVA_HOME
Please set the JAVA_HOME variable in your environment to match the
location of your Java installation."
fi
else
JAVACMD=java
which java >/dev/null 2>&1 || die "ERROR: JAVA_HOME is not set and no 'java' command could be found in your PATH.
Please set the JAVA_HOME variable in your environment to match the
location of your Java installation."
fi

# Increase the maximum file descriptors if we can.
if ! "$cygwin" && ! "$darwin" && ! "$nonstop" ; then
case $MAX_FD in #(
max*)
MAX_FD=$( ulimit -H -n ) ||
warn "Could not query maximum file descriptor limit"
esac
case $MAX_FD in #(
'' | soft) :;; #(
*)
ulimit -n "$MAX_FD" ||
warn "Could not set maximum file descriptor limit to $MAX_FD"
esac
fi

# Collect all arguments for the java command, stacking in reverse order:
# * args from the command line
# * the main class name
# * -classpath
# * -D...appname settings
# * --module-path (only if needed)
# * DEFAULT_JVM_OPTS, JAVA_OPTS, and GRADLE_OPTS environment variables.

# For Cygwin or MSYS, switch paths to Windows format before running java
if "$cygwin" || "$msys" ; then
APP_HOME=$( cygpath --path --mixed "$APP_HOME" )
CLASSPATH=$( cygpath --path --mixed "$CLASSPATH" )

JAVACMD=$( cygpath --unix "$JAVACMD" )

# Now convert the arguments - kludge to limit ourselves to /bin/sh
for arg do
if
case $arg in #(
-*) false ;; # don't mess with options #(
/?*) t=${arg#/} t=/${t%%/*} # looks like a POSIX filepath
[ -e "$t" ] ;; #(
*) false ;;
esac
then
arg=$( cygpath --path --ignore --mixed "$arg" )
fi
# Roll the args list around exactly as many times as the number of
# args, so each arg winds up back in the position where it started, but
# possibly modified.
#
# NB: a `for` loop captures its iteration list before it begins, so
# changing the positional parameters here affects neither the number of
# iterations, nor the values presented in `arg`.
shift # remove old arg
set -- "$@" "$arg" # push replacement arg
done
fi

# Collect all arguments for the java command;
# * $DEFAULT_JVM_OPTS, $JAVA_OPTS, and $GRADLE_OPTS can contain fragments of
# shell script including quotes and variable substitutions, so put them in
# double quotes to make sure that they get re-expanded; and
# * put everything else in single quotes, so that it's not re-expanded.

set -- \
"-Dorg.gradle.appname=$APP_BASE_NAME" \
-classpath "$CLASSPATH" \
org.gradle.wrapper.GradleWrapperMain \
"$@"

# Use "xargs" to parse quoted args.
#
# With -n1 it outputs one arg per line, with the quotes and backslashes removed.
#
# In Bash we could simply go:
#
# readarray ARGS < <( xargs -n1 <<<"$var" ) &&
# set -- "${ARGS[@]}" "$@"
#
# but POSIX shell has neither arrays nor command substitution, so instead we
# post-process each arg (as a line of input to sed) to backslash-escape any
# character that might be a shell metacharacter, then use eval to reverse
# that process (while maintaining the separation between arguments), and wrap
# the whole thing up as a single "set" statement.
#
# This will of course break if any of these variables contains a newline or
# an unmatched quote.
#

eval "set -- $(
printf '%s\n' "$DEFAULT_JVM_OPTS $JAVA_OPTS $GRADLE_OPTS" |
xargs -n1 |
sed ' s~[^-[:alnum:]+,./:=@_]~\\&~g; ' |
tr '\n' ' '
)" '"$@"'

exec "$JAVACMD" "$@"
Loading