Визуализировать алгоритмы раскраски.

• полная раскраска (Complete coloring)
• раскраска рёбер (Edge coloring)

Реализацию самих алгоритмов взять из QuickGraph.

2 человека, 2 алгоритма каждому.

• A Fast GPU Algorithm for Graph Connectivity
• A simple and practical linear-work parallel algorithm for connectivity
• Better speedups using simpler parallel programming for graph connectivity and biconnectivity
• SOME GPU ALGORITHMS FOR GRAPH CONNECTED COMPONENTS AND SPANNING TREE

Найти методы, где проседает производительность и улучшить.

Файл src/QuickGraph/AdjacencyGraph.cs

1 человек.

• Online Dynamic Graph Drawing
• Multi-Level Graph Layout on the GPU
• nVidia CUDA Platform in Graph Visualization

Restore PCL build.

• F# projects must be supported.
• MS VS 2015 and higher should be supported.
• Mono build should be supported.
• .Net Core (?) Investigate first.

Реализовать алгоритм построение клик.

Реализовать алгоритм bipartite dimension.
https://www.youtube.com/watch?v=ZXsQAXx_ao0

• Visualization (#162)
• Connectivity (#163)
• General (#164)
• Partitioning and cutting (#165)
• Shortest paths (#166)
• Subgraph matching (#167)

• Визуализация алгоритмов построения паросочетаний
• Решение задачи о назначениях
• Визуализация задачи о назначениях

So, why did quickGraph end its convertion to MSAGL support, but instead chose GLEE? As far as i know, GLEE transformed into MSAGL, and to download GLEE itself you must find a microsoft download page last updated in 2007. And It is not possible to create a MSAGL graph now, am i right?

Comment off GenerateReferenceDocs target and fix documentation generation.
Seems, that problem is related with this issue.

• Топологическая сортировка
  • /src/QuickGraph/Algorithms/TopologicalSort
  • все предложенные алгоритмы
• m-нумерация
• n-нумерация
• В чём разница между предложенными алгоритмами?

Create a cool logo.

Визуализация алгоритмов построения потоков
/src/QuickGraph/Algorithms/MaximumFlow

• Реализовать алгоритм построения хроматического многочлена
• Визуализация процесса построения хроматического многочлена

Hi,
First thanks for making this available on GitHub! I am new to quickgraph which I discovered recently. And I saw this fork tonight. I have two questions if you do not mind:

1. What is new with respect to the original one?
2. Can this be used in some way as a graph database (sorry I did not go through the src, yet)? Is it optimized for search (indexed, binary search or so)?
   Thanks!

Визуализация алгоритмов построения кратчайших путей (кроме Дейкстры)

/src/QuickGraph/Algorithms/ShortestPath

Hey,
I have had a need to use transitive reduction algorithm for some project I am working on. I am willing to contribute the code I used inspired by some matlab library I found(It is based off of V3.0 ). Not sure I will have enough time to implement proper testing thought.

Would that we OK for me to submit a PR ?

Thanks!

1 человек, 1 набор примитивов, 3-4 алгоритма. Статьи для доклада + статьи по которым реализация.

• Gunrock: a high-performance graph processing library on the GPU

• A compiler for throughput optimization of graph algorithms on GPUs

• Multi-GPU Graph Analytics

• GraphBIG: understanding graph computing in the context of industrial solutions

• Graph processing on GPUs: Where are the bottlenecks?

• Performance study of mapping irregular computations on GPUs

• Optimizing Graph Processing on GPUs

• BelRed: Constructing GPGPU graph applications with software building blocks

• Performance Evaluations of Graph Database using CUDA and OpenMP Compatible Libraries

• To implement

  • Programming GPGPU Graph Applications with Linear Algebra Building Blocks
  • Using OpenCL for Implementing Simple Parallel Graph Algorithms

• Найти уже существующиее решение, разобраться в нём
• Реализовать пару других подходов.
• Сравнить получившиеся решения.

Add YC prefix to DLLs' names. Names should looks like YC.QuickGraph.dll.

• Реализовать алгоритм Прима
  • Реализацию Прима "положить" рядом с Краскалом: src/QuickGraph/Algorithms/MinimumSpanningTree
• Визуализировать алгоритм Прима
• Визуализировать алгоритм Краскала

Really. What should we do?

• Remove it in order to make library compatible with mono, .NET Core, etc
• Migrate to VS-2015 IntelliTest
• Migrate to FsCheck
• Something else?

• алгоритм Дейкстры
  • /src/QuickGraph/Algorithms/ShortestPath
• обход в ширину
  • \src\QuickGraph\Algorithms\Search\
• обход в глубину
  • \src\QuickGraph\Algorithms\Search\

While looking through sources in file https://github.com/YaccConstructor/QuickGraph/blob/master/src/QuickGraph/CompressedSparseRowGraph.cs I've noticed that the method FromGraph seems likely not to work due to the fact that start variable isn't updated after initialization.

I've confirmed my suspicions: I've run Topological sort on adjacency graph (it turned out OK), then converted that graph to CSR and run on that - it throws QuickGraph.NonAcyclicGraphException

Sample code:

            // a simple adjacency graph representation
            int[][] graph = new int[5][];
            graph[0] = new int[] {  };
            graph[1] = new int[] { 2, 3 };
            graph[2] = new int[] { 3, 0 };
            graph[3] = new int[] { 0 };
            graph[4] = new int[] { 1 };

            // interoping with quickgraph
            var g = GraphExtensions.ToDelegateVertexAndEdgeListGraph(
                Enumerable.Range(0, graph.Length),
                v => Array.ConvertAll(graph[v], w => new SEquatableEdge<int>(v, w))
            );
            
            // it's ready to use!
            foreach (var v in g.TopologicalSort())
                Console.WriteLine(v);
            
            var csr = CompressedSparseRowGraph<int>.FromGraph(g);
            foreach (var vertex in csr.TopologicalSort())
            {
                Console.WriteLine(vertex);
            }

P.S. It turned out that there's no sense for me in using QuickGraph's CSR anyway, so I just want to report this.

Реализовать алгоритм раскраски вершин.

Do you have any plans to port Quickgraph to be usable in dotnet core?

Latest nuget package for 3.7.3.0 pulls down FSharp.Core 4.3.0.0

But YC.QuickGraphFS.dll (which has no version number BTW, should probably fix that too) contains reference to FSharp.Core 4.4.0.0

Реализовать алгоритм. Just do it!

Реализовать алгоритм разбиения графа.

2 человека, 2 алгоритма каждому. Обязательно должен быть реализован алгоритм разбиения на N равных подграфов.

• CUDA cuts: Fast graph cuts on the GPU
• Large-Scale Graph Processing Algorithms on the GPU (graph partition)
• Graph Coarsening and Clustering on the GPU
• GPU Accelerated Lanczos Algorithm with Applications
• Parallel and distributed graph cuts by dual decomposition
• Parallel graph-cuts by adaptive bottom-up merging
• Image segmentation: A survey of graph-cut methods
• Medical image segmentation on GPUs – A comprehensive review
• Light Field Segmentation Using a Ray-Based Graph Structure

Is this is "official" descendant of the original QuickGraph project which was hosted on https://quickgraph.codeplex.com/ ?

This project is described as a fork... which seems a little ambiguous. I'm not sure if I should use the libraries distributed here vs. using the original (and older?) versions from CodePlex, or if there is some other alternative?

Thank you

• Реализовать алгоритм Йена поиска k кратчайших путей.
• Визуализировать алгоритм
• реализовать пожелания

• Реализовать группировку вершин.
• Применить другие средства визуализации: GraphX, GraphSharp, MSVS Diagrams

Детали здесь

The ToString in HoffmanPavleyRankedShortestPathAlgorithm is implemented as

public override string ToString()
{
    return String.Format("{0} at {1} {2}", this.Weight, this.DeviationEdge);
}

This will obviously throw an exception as the number of arguments doesn't match the expected number in the format string.

As I'm not sure what the intended format is, I haven't submitted a PR to fix this.

2 человека, 2 алгоритма каждому.

• A new GPU-based approach to the Shortest Path problem
• PHAST: Hardware-accelerated shortest path trees
• Accelerating BFS shortest paths calculations using CUDA for Internet topology measurements
• Efficient Multi-GPU Computation of All-Pairs Shortest Paths
• On Ranking Nodes using kNN Graphs, Shortest-paths and GPUs
• Work-Efficient Parallel GPU Methods for Single-Source Shortest Paths

Automate package creation and publishing on build.

Создать пользовательский интерфейс для визуализации алгоритмов на графах.

• Чтение данных из dot
  • Переместить DotParserProject в общую структуру (\src\QuickGraph.)
  • Больше тестов. Уже всплыла как минимум одна проблема: YaccConstructor/YaccConstructor#145. Смотреть первое сообщение.
  • из файла
  • текстовое окно ввода
    • Удобно воспользоваться этим тулом http://avalonedit.net/
• GraphX для отрисовки графов
  • Реализовать конвертер графов QuickGraph в графы GraphX
• Для раскладки комнонент использовать avalonDock
• Возможность пошагового проигрывания алгоритма
• Список доступных алгоритмов
• Расширяемость списка алгоритмов

Реалиизовать и визуализировать алгоритмы проверки

• эйлеровости графа
• гамильтоновости графа
  • обязательно реализовать алгебраический метод.

Partition of vertices into disjoint dominating set. Calculate domatic number.

We need a good documentation.
We have own site.
There is an original documentation.
What we should do.

• Create auto generated documentation.
• Improve auto generated documentation (add more informative comments in code).
• Migrate important parts (basic examples at most) of original documentation to our site.

The latest package version available on NuGet.org is 3.7.3, which is some way behind what's currently been merged to master in this repo. Is there any chance a new package can be published with the latest changes (assuming master is release-able)?

We're currently using some of the features from master (ComputeTransitiveReduction etc) which are not in the 3.7.3 release, and not having to create our own internal package would be great.

• Move fsa to src/QuickGraph.FSA
• Move fst to src/QuickGraph.FST
• Move tests to tests/QuickGraph.***.Tests
• Add all projects to QuickGraph.sln
• Replace refs to QuickGraph package with direct refs to appropriate projects.

• #3
• Automate NuGet package(s) creation and publication
• Publish new version!

I see a BidirectionalDepthFirstSearchAlgorithm but not a BidirectionalBreadthFirstSearchAlgorithm.

Any particular reason why not?

I have a use for it and wouldn't mind implementing it myself unless there's a reason not to do it.

• Реализовать на основе существующих алгоритмов их модификации, возвращающие компоненты связанности в виде готовых графов (сейчас возвращается коллекция вершин с указанием того, какой компоненте она принадлежит)
• Визуализация алгоритмов построения связанных компонент
  • Связанные
  • Сильно связанные
  • Слабо связанные

/src/QuickGraph/Algorithms/ConnectedComponents

Hi,
I have installed the NuGet Package using> Install-Package YC.QuickGraph
Afterwards I tried to run the application, but it seems that the assemblies are not signed, because I receive the following exception:

System.IO.FileLoadException: 'Could not load file or assembly 'YC.QuickGraph, Version=3.7.3.0, Culture=neutral, PublicKeyToken=null' or one of its dependencies. A strongly-named assembly is required. (Exception from HRESULT: 0x80131044)'

All my assemblies are signed and usually frameworks have signed assemblies and I would rater avoid cloning the repository to build and sign the assemblies.

Can you please fix this and release a new version on NuGet?

Thank you.

1 человек, 2 алгорима.

• Fast Subgraph Matching on Large Graphs using Graphics Processors
• Efficient Subgraph Matching Using GPUs
• GPU acceleration of subgraph isomorphism search in large scale graph
• Towards GPU-Based Common-Sense Reasoning: Using Fast Subgraph Matching

Реализовать построение порождённого пути.

Automate tests execution. Note that Pex is used for tests.