mirror of
https://github.com/UnickSoft/graphonline.git
synced 2025-07-01 23:36:00 +00:00
21 lines
3.5 KiB
Plaintext
Executable File
21 lines
3.5 KiB
Plaintext
Executable File
version=pmwiki-2.2.75 ordered=1 urlencoded=1
|
||
agent=Mozilla/5.0 (Macintosh; Intel Mac OS X 10_11_6) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/54.0.2840.59 Safari/537.36 OPR/41.0.2353.46
|
||
author=
|
||
charset=UTF-8
|
||
csum=
|
||
ctime=1478122943
|
||
description=How you can find Eulerian cycle using graphonline service
|
||
host=82.145.220.53
|
||
name=Help.FindEulerianCycle
|
||
rev=2
|
||
targets=
|
||
text=(:Title Search of Eulerian cycle :)%0a(:Description How you can find Eulerian cycle using graphonline service :)%0a%0a!! Eulerian cycle%0a%0aEulerian cycle, or circuit is a closed path which visits every edge of a graph just once. %0a %0a!! Search algorithm%0a%0aGraphonline.ru uses search algorithm based on cycles. %0a%0a''Let’s consider the general case, the case of oriented multigraph, possibly with self-loops. Moreover, we assume that there is a eulerian path in the graph and it consists of one vertex at least. In order to find the eulerian trail we will take into account that a eulerian path is the aggregation of all simple cycles of the graph. Consequently, our task is to find all the cycles effectively and combine them into one, effectively as well. ''%0a%0aBesides, before searching for a cycle, the service checks whether a cycle exists or not. In this regard there is a search of vertices degree. %0a%0aYou may find more detailed information about the algorithm in Wikipedia. %0a%0aThe implementation of the algorithm in C++ may be found in our repository on GitHub: [[https://github.com/UnickSoft/GraphOffline/blob/master/algorithm/EulerianLoop.cpp | The implementation of Eulerian trail search in Graphoffline]].%0a%0a!! How to use %0a%0a# Create a graph.%0a# Select “Find Eulerian cycle” in the menu bar. %0a%0ahttp://graphonline.ru/en/wiki/uploads/Help/graphonline_ru_en_eulerian_cycle.gif%0a%0a
|
||
time=1478345509
|
||
title=Search of Eulerian cycle
|
||
author:1478345509=
|
||
diff:1478345509:1478122943:=25d24%0a%3c http://graphonline.ru/en/wiki/uploads/Help/graphonline_ru_en_eulerian_cycle.gif%0a
|
||
host:1478345509=82.145.220.53
|
||
author:1478122943=
|
||
diff:1478122943:1478122943:=1,25d0%0a%3c (:Title Search of Eulerian cycle :)%0a%3c (:Description How you can find Eulerian cycle using graphonline service :)%0a%3c %0a%3c !! Eulerian cycle%0a%3c %0a%3c Eulerian cycle, or circuit is a closed path which visits every edge of a graph just once. %0a%3c %0a%3c !! Search algorithm%0a%3c %0a%3c Graphonline.ru uses search algorithm based on cycles. %0a%3c %0a%3c ''Let’s consider the general case, the case of oriented multigraph, possibly with self-loops. Moreover, we assume that there is a eulerian path in the graph and it consists of one vertex at least. In order to find the eulerian trail we will take into account that a eulerian path is the aggregation of all simple cycles of the graph. Consequently, our task is to find all the cycles effectively and combine them into one, effectively as well. ''%0a%3c %0a%3c Besides, before searching for a cycle, the service checks whether a cycle exists or not. In this regard there is a search of vertices degree. %0a%3c %0a%3c You may find more detailed information about the algorithm in Wikipedia. %0a%3c %0a%3c The implementation of the algorithm in C++ may be found in our repository on GitHub: [[https://github.com/UnickSoft/GraphOffline/blob/master/algorithm/EulerianLoop.cpp | The implementation of Eulerian trail search in Graphoffline]].%0a%3c %0a%3c !! How to use %0a%3c %0a%3c # Create a graph.%0a%3c # Select “Find Eulerian cycle” in the menu bar. %0a%3c %0a%3c %0a
|
||
host:1478122943=82.145.221.45
|