Mark & Sandy
Lorem ipsum dolor sit amet, consectetur adipisicing elit. Eius tenetur recusandae harum qui dolore. Deleniti expedita, quod eveniet accusamus, optio neque reiciendis eaque qui magni quasi, rem nisi, tempora beatae!
Tell me, tell me time and time again. With a toy on Christmas Day. Talking sweet and looking fine, I get kinda hectic inside. Turn to the right, ooh hes so smooth with it.
Blindly I imagined I could keep you under glass. It's easy to succumb to overwhelming fears inside.
If I was drowning, suffocating. It's a shame you don't know me at all. So spread your wings and fly. I don't need to hang my stocking. There is just one thing I need.


---
layout: post
title: Free Storyboards template 16:9
date: '2017-09-18T11:30:28+02:00'
categories:
- Templates
picture_url: https://film-Storyboards.tumblr.com/post/165478306759/free-Storyboards-template-16x9
---
This is a free Storyboards template in PDF format on DIN A4 horizontal (landscape).
This template has 2 frames per sheet each in 16:9 aspect ratio (1.77:1) with accompanying boxes for set plan.
This template is useful if you have slightly complex scenes where you want to indicate where the camera is. The film ratio is 16:9 (1.77:1).
Print it out to draw on paper, the old school way (no cheating).
If you are looking for an editable template similar to this PDF, you can find an InDesign version here: https://gum.co/16x9_sets.


Abstract:
The Set Up
The problems goal is to track a certain time-series containing the returns (the % gain if we invest one dollar at the beginning of period \(t\), and collect it at the end of the period) of a certain financial index, (for example the SP 500 index).
The index by itself may not be tradable, or it may be very costly to trade it because it has too many assets in it. However we can try to invest in a few tradable assets, such as stocks, and hope to closely follow the index so that the return of our portfolio matches that of the index.
Mathematical Set Up
Mathematically, we are given a real-valued time-series \(s(t)\) with time \(t\) from \({1, \cdots, T}\). Here, \(s(t)\) is the return of the index at time \(t\).
We also have a universe of \(n\) possible tradable assets, with, \(s_i(t), \: t = 1, \cdots , T\) the return time-series for asset \(i, \: i = 1, \cdots, n\).
Investing an amount \(x_i\) in the \(i\)-th asset at the beginning of period \(t\) produces the return \(x_is_i(t)\) at the end of period \(t\).
Approach
Here our variable is the vector of amounts invested in each asset, \(x = (x_1, \cdots, x_n)\), which we refer to as the “portfolio vector”.
In order to minimize the transaction costs involved in trading each asset, we would like to limit the number of assets present in the portfolio.
We plan to find the vector \(x \in \mathbf{R}^n\) based on the available data, and hold it for some time in the future.
Proposed Formulation
We start by expressing the time series of returns of the portfolio vector \(x, s(x)\), as a linear function of \(x\).
Where the \(t\)-th coordinate of \(s(x)\) is the return of the portfolio at time \(t\).
Precisely, we will express the time series as a \(T\)-dimensional vector \(s(x) = Ax\), with \(x \in \mathbf{R}^n\) and \(A\) a \((T \times n)\) matrix expressed in terms of the data.
First, we Let \(s = (s(1), \cdots, s(T)) \in \mathbf{R}^T\) and \(s_i = (s_i(1), \cdots, s_i(T)) \in \mathbf{R}^T , i = 1, \cdots, n\).
Now, we can express,
$$s(x) = \sum_{i=1}^n x_is_i = Ax,$$
where \(A = [s_1, \cdots, s_n]\) a \((T \times n)\) matrix.
Now, we formulate the problem of minimizing the tracknig error as a Least-Sqaures Problem
Remember that the tracking error is defined as the average squared error between the return of the index and that of the portfolio.
We, also, assume “Shorting” is allowed
i.e. selling assets.
Mathematically, the tracking error is
$$ \dfrac{1}{T} \sum_{t=1}^T \left(s(t) - \sum_{i=1}^n x_is_i(t) \right)^2$$
We rewrite this as a norm
$$\dfrac{1}{T} \|Ax - s\|_2^2$$
Now, the Least-Squares problem comes naturally as minimizing the tracking error is just minimizing a sum of squares with no constraints
$${\displaystyle \min_x \|Ax - s\|_2^2}$$
Assume that Shorting is not allowed anymore. We try to reformulate the problem by adding the shorting constraint
When shorting is not allowed, \(x\) cannot be negative. Thus, we add the constraints \(x \geq 0\) to the least-squares problem,
$$\min_x \|Ax - s\|_2^2 \:\: : \:\: x \geq 0 $$
resulting in a QP (Quadratic Program) formulation of the problem,
$$\min_x x^TQx + c^Tx \:\: : \:\: Cx \leq d$$
which is a QP in standard form, with
$$C = −I_n, d = 0, c = −2A^Ts,$$ and $$Q \:= A^TA$$ is a positive semi-definite matrix.
We add our concern for transaction costs; i.e. trading-off the tracking error against the number of assets that have to be traded.
To control the transaction costs we need to minimize the number of non-zero components of \(x\),
since a zero value in \(x_i\) means the \(i\)-th asset will not have to be traded.
The \(l_1\) norm allows us to minimize the number of non-zero components of a vector \(\vec{x}\).
Thus, we add a regularized \(l_1\) term to the original Least-Squares problem,
$$\min_x \|Ax - s\|_2^2 + \lambda \|x\|_1 \:\: : \:\: x \geq 0 $$
where \(\lambda \geq 0\) is the regularization parameter that controls the trade-off between the tracking error and the number of assets (i.e. the transaction costs).
We notice that as \(\lambda\) gets bigger the number of non-zero components in \(x\) decreases and vice-versa.
Finally, we formulate the above problem as a Quadratic Program (QP)
We write,
$$\min_x \|Ax - s\|_2^2 + \lambda \|x\|_1 \:\: : \:\: x \geq 0 $$
$$= \min_x \|Ax - s\|_2^2 + \lambda \vec{1}^T x \:\: : \:\: x \geq 0 $$
where \(\vec{1}\) is the vector of all ones.
This allows us to formulate the QP,
$$\min_x x^TQx + (c + \lambda \vec{1})^Tx \:\: : \:\: Cx \leq d$$
Q.E.D


Thanos, is trying to destroy the entire universe. Some Avengers have already died to thanos in Avengers infinity war.
The remaining Avengers reassemble to undo all the bad that thanos has caused. As they call in allies and travel back
and forth in time, they attempt to reverse the destruction of Thanos. They have to restore order to the universe.
Thanos has been going around on planets killing half of their population in order to help the amount of food.
in order to make this process faster he needs to gather the 5 infity stones, but the avengers will do anything to stop him


{% extends "generic/base.html" %} {% block title %}Material Delete{% endblock %} {% block content %} Delete Material Are you certain you want to delete this Material? Please be sure to edit any Specifications that are currently using this material. Material name: {{ material.name }} {% csrf_token %} {% endblock %}
Are you certain you want to delete this Material? Please be sure to edit any Specifications that are currently using this material.
Material name: {{ material.name }}


Jan Clark v Mary Richards
Claim number: 352MC733
Prepare for the hearing
You must comply with the court's directions to prepare for the hearing:
1) Upload evidence
You must upload and submit your own statement, any witness statements and copies of all documents you intend to rely on at the hearing. You must upload them no later than 4pm on XX January 2019.
2) Free telephone mediation
The court has reviewed your documents and believes that your claim is suitable for telephone mediation. This is a free service to give you the opportunity to resolve your dispute without having to attend a court hearing.
If you fail to comply with the directions
The claim may be adjourned and you may have to pay costs.
If you don't agree with the order
You have the right to apply to have the order set aside, varied or stayed. If you make such an application you must pay a fee and deliver it to the court within seven days.
The court sent you an order
Download the court order (PDF, 13KB)
Jan Clark rejected your response
Download their proposed hearing requirements (PDF, 13KB)
You proposed your hearing requirements
Download your proposed hearing requirements (PDF, 13KB)
Claim made against you
Download claim (PDF, 123KB)
You can still settle out of court
If the case isn't resolved through mediation, you can still settle it without going to court.
For example you could offer to fix goods you sold the claimant or suggest a payment.
You can avoid getting a County Court Judgment if the claimant accepts your offer.


{{sentence}}swimming
{% if likes_same_sport == True %}
it is a good sport because it is fun and healthy
Here are some famous swimmers:
{% for swimmer in swimmers %}
{{swimmer}}
{% endfor %}
{% else %}
it is a good sport because it is fun and healthy
{% endif %}


 We hid the crazy tray....

 Way far prancing grand camping gone too. Gray hallways spew spit ’cause goo. Paddy, paddy, shoe plastered, time grew.
 Way far prancing grand camping gone too. Gray hallways *spew* spit ’cause goo. Paddy, paddy, shoe plastered, time grew.
 Done love frees quill sing pilaster.


Cookie Store
Home
Order
About
🍪 Overview
We sell cookies! Locally made, locally loved 💛
👨🏻🍳 How to Order
Check out our order menu
Select the cookies you wish to purchase
Place your order
Expect delicious cookies in the mail soon


 A translation table links the given URLs to frames(or
sets of frames) of the animation. Clicking on the applet while a given image is
showing navigates to the URL linked to that image. Optionally, when the mouse
is not over the applet an timer will auto advance through the images. It uses
off-screen buffering to avoid flicker. The full documentation for the APPLET tag is in
the source code, AnimNav.java.
I would love to see your improvements.
Elijah.
<EMAIL_ADDRESS>http://www.realtime.net/~elijah/


Publications
DBLP | Google Scholar | Research Gate
2015
- Rizzo G., Troncy R., Corcho O., Jameson A., Plu J., Ballesteros Hermida J.C., Assaf A., Barbu C., Spirescu A., Kuhn K., Celino I., Agarwal R., Nguyen C.K., Pathak A., Scanu C., Valla M., Haaker T., Verga E.S., Rossi M., Redondo Garcia J.L. (2015) 3cixty@Expo Milano 2015: Enabling Visitors to Explore a Smart City. In: 14th International Semantic Web Conference (ISWC'15) Semantic Web Challenge, Bethlehem, Pennsylvania, USA.
Winner of the Semantic Web Challenge
- Redondo Garcia J. L., Rizzo G., Troncy R. (2015) Capturing News Stories Once, Retelling a Thousand Ways. In: 8th International Conference on Knowledge Capture (K-CAP'15), Palisades, NY, USA.
- Redondo Garcia J. L., Rizzo G., Troncy R. (2015) The Concentric Nature of News Semantic Snapshots: Knowledge Extraction for Semantic Annotation of News Items. In: 8th International Conference on Knowledge Capture (K-CAP'15), Palisades, NY, USA.
BEST Paper Award
- Redondo Garcia J. L., Rizzo G., Romero L. P., Hildebrand M., Troncy R. (2015) Generating Semantic Snapshots of Newscasts using Entity Expansion. In: 15th International Conference on Web Engineering (ICWE'15), Rotterdam, the Netherlands.
2014
- Evlampios Apostolidis, Vasileios Mezaris, Mathilde Sahuguet, Benoit Huet, Barbora Cervenková, Daniel Stein, Stefan Eickeler, José Luis Redondo Garcia, Raphaël Troncy and Lukas Pikora. Automatic Fine-grained Hyperlinking of Videos within a Closed Collection using Scene Segmentation. In 22nd ACM International Conference on Multimedia (ACMMM'14), November 3-7, Orlando, Florida, USA. (doi).
- José Luis Redondo Garcia, Mariela Sabatino, Pasquale Lisena and Raphaël Troncy. Finding and sharing hot spots in Web Videos. In 13th International Semantic Web Conference (ISWC'14), Demo Track, CEUR Proceedings Vol. 1272, pages 141-144, October 21-23, Riva del Garda, Italy.
- José Luis Redondo-Garcia, Michiel Hildebrand, Lilia Perez Romero and Raphaël Troncy. Augmenting TV Newscasts via Entity Expansion. In 11th Extended Semantic Web Conference (ESWC'14), Demos Track, vol. LNCS 8798, pages 472-476, May 25-29, Anissaras, Crete.
- Lilia Perez Romero, Michiel Hildebrand, José Luis Redondo-Garcia and Lynda Hardman. LinkedTV News: A dual mode second screen companion for web-enriched news broadcasts. In ACM International Conference on Interactive Experiences for Television and Online Video 2014 (ACM TVX 1), June 25-27, Newcastle, UK.
- José Luis Redondo García, Laurens De Vocht, Raphaël Troncy, Erik Mannens and Rik Van de Walle. Describing and Contextualizing Events in TV News Show. In (WWW'14) 2nd International Workshop on Social News on the Web (SNOW'14), pages 759-764, April 7, Seoul, South Korea. (doi).
2013
- José Luis Redondo Garcia and Raphaël Troncy. Television meets the Web: a Multimedia Hypervideo Experience. At 12th International Semantic Web Conference (ISWC'13), Doctoral Consortium Track, CEUR Proceedings Vol. 1045, October 22, Sydney, Australia.
- Mathilde Sahuguet, Benoit Huet, Barbora Červenková, Evlampios Apostolidis, Vasileios Mezaris, Daniel Stein, Stefan Eickeler, José Luis Redondo Garcia, Raphaël Troncy and Lukáš Pikora. LinkedTV at MediaEval 2013 Search and Hyperlinking Task. At MediaEval Benchmarking Initiative for Multimedia Evaluation, CEUR Proceedings Vol. 1043, October 18-19, Barcelona, Spain.
- Daniel Stein, Alp Öktem, Evlampios Apostolidis, Vasileios Mezaris, José Luis Redondo García, Raphaël Troncy, Mathilde Sahuguet, Benoit Huet. From Raw Data to Semantically Enriched Hyperlinking: Recent Advances in the LinkedTV Analysis Workflow. In NEM Summit: Networked & Electronic Media, October 28-30, Nantes, France.
- Milicic V., Redondo Garcia J.L., Rizzo G., Troncy R. (2013), Grab your Favorite Video Fragment: Interact with a Kinect and Discover Enriched Hypervideo. Demo at European Interactive TV Conference (EuroITV'13), Como, Italy.
- Milicic V., Redondo Garcia J.L., Rizzo G., Troncy R. (2013), Tracking and Analyzing The 2013 Italian Election. Demo at Extended Semantic Web Conference (ESWC'13), Montpellier, France.
- Li Y., Rizzo G., Redondo Garcia J.L., Troncy R. (2013), Enriching Media Fragments with Named Entities for Video Classification. In (WWW'13) 1st Worldwide Web Workshop on Linked Media (LiME'13), Rio de Janeiro, Brazil.
- Troncy R., Milicic V., Rizzo G., Redondo Garcia J.L. (2013), MediaFinder: Collect, Enrich and Visualize Media Memes Shared by the Crowd. In (WWW'13) 2nd International Workshop on Real-Time Analysis and Mining of Social Streams (RAMSS'13), Rio de Janeiro, Brazil.
- Milicic V.,Rizzo G., Redondo Garcia J.L., Troncy R., Steiner T. (2013), Live Topic Generation from Event Streams. Demo at International World Wide Web Conference (WWW'13), Rio de Janeiro, Brazil.
2012
- Steiner T., Verborgh R., Troncy R., Rizzo G., Redondo Garcia J.L., Gabarro J. and Van De Walle R. (2012), Modeling and Reconciling Nightlife Events from Public Event Databases for the Automatic Generation of Magazines. Demo at the DeRiVE'12) workshop at the International Semantic Web Conference (ISWC'12), Boston, USA.
- Rizzo G., Steiner T., Troncy R., Verborgh R., Redondo Garcia J. L. and Van de Walle R. (2012), What Fresh Media Are You Looking For? Extracting Media Items from Multiple Social Networks. In (ACM Multimedia) International Workshop on Socially-Aware Multimedia (SAM'12), Nara, Japan.
- Redondo Garcia J. L., Lozano-Tello A. (2012), OntoTV: an Ontology Based System for the Management of Information about Television Content. At International Journal of Semantic Computing, 6(01), 111-130, 2012.
- Redondo Garcia J. L., Boton-Fernandez V., Lozano-Tello A. (2012), Linked data methodologies for managing information about television content. At International Journal of Interactive Multimedia and Artificial Intelligence, 1(6), 2012.
- Boton-Fernandez V., Redondo Garcia J. L., Lozano-Tello A. (2012), Aprendizaje de secuencias de acción para la toma de decisiones en instalaciones domóticas. At International Journal on Computer Science and Engineering. Special Issue. Vol 2, No 4, pp 1-8.
- Redondo Garcia J. L., Boton-Fernandez V., Lozano-Tello A. (2012), Linked Data methodologies for managing information about television content. At 7th Iberian Conference on Information Systems and Technologies (CISTI), 20-23 June, Madrid, Spain.
- Boton-Fernandez V., Redondo Garcia J. L., Lozano-Tello A. (2012), Learning action sequences for decision- making in home automation systems. At 7th Iberian Conference on Information Systems and Technologies (CISTI), 20-23 June, Madrid, Spain.
2011
- Redondo Garcia J. L., Prieto A., Lozano-Tello A. (2011), Collecting Data about Television Contents in the OntoTV System. At 6th Iberian Conference on Information Systems and Technologies (CISTI)>, pp. 91–97, June 2011, Chaves, Portugal.
- Prieto A., Lozano-Tello A., Redondo Garcia J. L. (2011), OntoMetaWorkflow: An Ontology for Representing Data and Users in Workflows. At 7th Workshop on Knowledge Engineering and Software Engineering in 14th Conference of the Spanish Association in Artificial Intelligence (CAEPIA 2011), 7-11 November, S. Cristobal de la Laguna, Spain.
- Redondo Garcia J. L., Prieto A., Lozano-Tello A. (2011), Improving Television Program Guides by Accessing Linked Data Resources in OntoTV System. At Linked Data Workshop in Spain in 14th Conference of the Spanish Association in Artificial Intelligence (CAEPIA 2011), 7-11 November, S. Cristobal de la Laguna, Spain.
2010
- Redondo Garcia J. L., Valiente-Rocha P., Lozano-Tello A. (2010), Ontology-based System for Content Management in Digital Television. At 5th Iberian Conference on Information Systems and Technologies (CISTI), pp. 277–283, June, Santiago de Compostela, Spain.
- Valiente-Rocha P., Redondo Garcia J. L., Lozano-Tello A. (2010), Ambient intelligence system for controlling home automation installations. At 5th Iberian Conference on Information Systems and Technologies (CISTI), pp. 296-301, June, Santiago de Compostela, Spain.
2009
- Redondo Garcia J. L., Gonzalez-Sanchez J.L., Gazo-Cervero A., Corral-Garcia J. (2009), The New Digital Television and the Interactivity in its Multimedia Applications. At International Conference on Signal Processing and Multimedia Applications (SIGMAP), pp. 167-172, 7-10 July, Milan, Italy.
- Corral-Garcia J., del Arco González C., Gonzalez-Sanchez J.L., Redondo Garcia J. L., (2009), Free Security Suite 2 - Easy, Intuitive and Complete Free Security Suite with Web Browser Integration. At International Conference on Security and Cryptography (SECRYPT), pp. 341-344, 7-10 July, Milan, Italy.


| Date | Coin | Price | Status | Hardware Wallet | Buy | Block Height | Action |
|---|---|---|---|---|---|---|---|
| 01/08/2017 | Bitcoin Cash | Complete | Yes | 478558 | |||
| 30/10/2017 | Bitcore | Active | No | ||||
| 31/10/2017 | Bitcoin Gold | Complete | Yes | 491407 | |||
| 24/11/2017 | Bitcoin Diamond | Complete | No | 495866 | |||
| 13/12/2017 | Super Bitcoin | Complete | No | 498888 | |||
| 12/12/2017 | Bitcoin Hot |
|
Complete | No | 498848 | ||
| 31/12/2017 | Bitcoin Pizza (BPA) | N/A | Undergoing | No | N/A | 501888 | |
| 18/12/2017 | Bitcoin Faith (BTF) | N/A | Undergoing | No | N/A | 500000 | |
| 01/01/2018 | Bitcoin ALL (BTA) | N/A | Undergoing | No | N/A |<PHONE_NUMBER> (FTS) | |
| 31/12/2017 | Bitcoin Payment Performance (BPP) | N/A | Undergoing | No | N/A | 501888 | |
| 23/12/2017 | Lightning Bitcoin (LBTC) | N/A | Undergoing | No | 499999 | ||
| 23/12/2017 | Bitcoin Platinum (BTP) | N/A | Undergoing | No | N/A | 500000 | |
| 25/12/2017 | Bitcoin God (BTG) | N/A | Unknown | No | N/A | 501225 | |
| 25/12/2017 | Bitcoin World (BTW) | N/A | Upcoming | No | N/A | 499777 | |
| 31/12/2017 | BCO (Bitcoin Ore) | N/A | Upcoming | No | N/A | 501949 | |
| 20/01/2018 | Bitcoin Smart（BCS) | N/A | Upcoming | No | N/A | 505050 | |
| 25/12/2017 | Bitcoin Uranium | N/A | Unknown | No | N/A | No official website not a great start. | |
| 25/12/2017 | Bitcoin Silver | Active | No | N/A | Website tested positive on the Ethereum Phishing Detector (no direct link) | ||
| 02/01/2018 | Bitcoin Cash Plus (BCP) | N/A | Undergoing | No | N/A | 501407 | |
| 02/01/2018 | Quantum Bitcoin (QBTC) | N/A | Undergoing | No | N/A | 501368 | |
| 2017/12/26 | BitcoinFile（BIFI） | N/A | Undergoing | No | N/A | 501225 | |
| 22/01/2018 | Bitcoin Interest | N/A | Not Active | No | |||
| Late Decemeber | Bitcoin Atom | N/A | Not Active | No | N/A | ||
| 12/12/2017 | Bitcoin X (BCX) | Undergoing | No | 498888 | |||
| 12/12/2017 | OilBTC (OBTC) | N/A | Undergoing | No | N/A | 498888 | |
| 18/12/2017 | United Bitcoin | Complete | No | N/A | 498777 | ||
| 18/12/2017 | Bitcoin Stack（BTCS） | N/A | Undergoing | No | N/A | 499999 | |
| 18/12/2017 | Bitcoin King (BCK) | N/A | Undergoing | No | N/A | 499999 | |
| 15/12/2017 | Bitcoin Pay (BTP) | N/A | Undergoing | No | N/A | 499345 |
A hard fork (or sometimes hardfork) is a radical change to the bitcoin protocol that makes previously invalid blocks/transactions valid (or vice-versa) this results in split and a new version of Bitcoin. For every original Bitcoin, you held you get one of these new bitcoins. Some have value and some do not.
To claim your new coins you have to split your blockchain. How to do this varies from fork to fork we will be adding a guide for each fork soon.


|
GraphLayoutLibrary
|
The BoostGraphWrapper class. More...
#include <BoostGraphWrapper.h>
Public Member Functions | |
Creators | |
The methods under this section are responsible for constructing an instance of type BoostGraphWrapper. | |
| BoostGraphWrapper () | |
| BoostGraphWrapper (SubGraph graph) | |
Modifiers | |
The methods under this section are responsible for modifying an instance of type BoostGraphWrapper. | |
| VertexDescriptor | addVertex () |
| VertexDescriptor | addVertex (VertexDescriptor &vertex) |
| VertexDescriptor | addVertex (SubGraph &subgraph) |
| VertexDescriptor | addVertex (VertexDescriptor &vertex, SubGraph &subgraph) |
| VertexDescriptor | addVertex (SubGraph &subgraph, LayoutEnum::NodeType enVertexType) |
| EdgeBoolPair | addEdge (VertexDescriptor &vertex1, VertexDescriptor &vertex2) |
| EdgeBoolPair | addEdge (VertexDescriptor &vertex1, VertexDescriptor &vertex2, SubGraph &subgraph) |
| EdgeBoolPair | addEdge (VertexDescriptor &vertex1, VertexDescriptor &vertex2, SubGraph &subgraph, LayoutEnum::EdgeType enEdgeType) |
| void | removeEdge (EdgeDescriptor &eEdge, SubGraph &gGraph) |
| void | removeEdge (EdgeDescriptor &eEdge) |
| void | removeEdge (VertexDescriptor &vSource, VertexDescriptor &vTarget, SubGraph &gGraph) |
| void | removeEdge (VertexDescriptor &vSource, VertexDescriptor &vTarget) |
| SubGraph & | addSubgraph () |
| SubGraph & | addSubgraph (SubGraph &subgraph) |
| void | setVertexId (VertexDescriptor &vertex, SubGraph &subgraph, QString sId) |
| void | setVertexId (VertexDescriptor &vertex, QString sId) |
| void | setVertexHeight (VertexDescriptor &vertex, SubGraph &subgraph, int iHeight) |
| void | setVertexHeight (VertexDescriptor &vertex, int iHeight) |
| void | setVertexWidth (VertexDescriptor &vertex, SubGraph &subgraph, int iWidth) |
| void | setVertexWidth (VertexDescriptor &vertex, int iWidth) |
| void | setVertexLeftCoordX (VertexDescriptor &vertex, int iLeftCoordX) |
| void | setVertexLeftCoordX (VertexDescriptor &vertex, SubGraph &subgraph, int iLeftCoordX) |
| void | setVertexLeftCoordY (VertexDescriptor &vertex, SubGraph &subgraph, int iLeftCoordY) |
| void | setVertexLeftCoordY (VertexDescriptor &vertex, int iLeftCoordY) |
| void | setVertexCenterCoordY (VertexDescriptor &vertex, SubGraph &subgraph, int iCoordY) |
| void | setVertexCenterCoordY (VertexDescriptor &vertex, int iCoordY) |
| void | setVertexIsInvisible (VertexDescriptor &vertex, SubGraph &subgraph, bool bIsInvisible) |
| void | setVertexIsInvisible (VertexDescriptor &vertex, bool bIsInvisible) |
| void | setVertexExpandable (VertexDescriptor &vertex, SubGraph &subgraph, bool bIsExpandable) |
| void | setVertexExpandable (VertexDescriptor &vertex, bool bIsExpandable) |
| void | setVertexTreeWidth (VertexDescriptor &vertex, SubGraph &subgraph, int iTreeWidth) |
| void | setVertexTreeWidth (VertexDescriptor &vertex, int iTreeWidth) |
| void | setVertexDistanceFromRoot (VertexDescriptor &vertex, SubGraph &subgraph, int iDistanceFromRoot) |
| void | setVertexDistanceFromRoot (VertexDescriptor &vertex, int iDistanceFromRoot) |
| void | setVertexRank (VertexDescriptor &vertex, SubGraph &subgraph, int iRank) |
| void | setVertexRank (VertexDescriptor &vertex, int iRank) |
| void | setVertexHorizontalPosition (VertexDescriptor &vertex, SubGraph &subgraph, int iHorizontalPosition) |
| void | setVertexHorizontalPosition (VertexDescriptor &vertex, int iHorizontalPosition) |
| void | setVertexBarryCenter (VertexDescriptor &vertex, SubGraph &subgraph, double dBarryCenter) |
| void | setVertexBarryCenter (VertexDescriptor &vertex, double dBarryCenter) |
| void | setVertexTreeLeftX (VertexDescriptor &vertex, SubGraph &subgraph, int iTreeLeftX) |
| void | setVertexTreeLeftX (VertexDescriptor &vertex, int iTreeLeftX) |
| void | setVertexType (VertexDescriptor &vertex, SubGraph &subgraph, LayoutEnum::NodeType enVertexType) |
| void | setVertexType (VertexDescriptor &vertex, LayoutEnum::NodeType enVertexType) |
| void | setVertexVisited (VertexDescriptor &vertex, SubGraph &subgraph, bool bVisited) |
| void | setVertexVisited (VertexDescriptor &vertex, bool bVisited) |
| void | setVertexTopologicalOrder (int iTopologicalOrder, VertexDescriptor &vertex, SubGraph &subgraph) |
| void | setVertexTopologicalOrder (int iTopologicalOrder, VertexDescriptor &vertex) |
| void | setEdgeId (EdgeDescriptor &edge, SubGraph &subgraph, QString sId) |
| void | setEdgeId (EdgeDescriptor &edge, QString sId) |
| void | setEdgeIndex (EdgeDescriptor &edge, SubGraph &subgraph, std::size_t iEdgeIndex) |
| void | setEdgeIndex (EdgeDescriptor &edge, std::size_t iEdgeIndex) |
| void | setEdgeBidirectional (EdgeDescriptor &edge, SubGraph &subgraph, bool bBidirectional) |
| void | setEdgeBidirectional (EdgeDescriptor &edge, bool bBidirectional) |
| void | setEdgeIsInvisible (EdgeDescriptor &edge, SubGraph &subgraph, bool bIsInvisible) |
| void | setEdgeIsInvisible (EdgeDescriptor &edge, bool bIsInvisible) |
| void | setEdgeVisited (EdgeDescriptor &edge, SubGraph &subgraph, bool bVisited) |
| void | setEdgeVisited (EdgeDescriptor &edge, bool bVisited) |
| void | setEdgeType (EdgeDescriptor eEdge, SubGraph &subgraph, LayoutEnum::EdgeType enEdgeType) |
| void | setEdgeType (EdgeDescriptor eEdge, LayoutEnum::EdgeType enEdgeType) |
| void | setEdgeReversed (EdgeDescriptor &edge, SubGraph &subgraph, bool bReversed) |
| void | setEdgeReversed (EdgeDescriptor &edge, bool bReversed) |
| void | setEdgeIsConflicted (EdgeDescriptor &edge, SubGraph &subgraph, bool bIsConflicted) |
| void | setEdgeIsConflicted (EdgeDescriptor &edge, bool bIsConflicted) |
| void | addBendPoint (BendPoints *bendPointRef, EdgeDescriptor eEdge, SubGraph &gGraph) |
| void | setGraphId (QString sId, SubGraph &gSubgraph) |
| void | setGraphId (QString sId) |
| void | setGraphDummyNodeIndex (std::size_t iDummyNodeIndex, SubGraph &gSubgraph) |
| void | setGraphDummyNodeIndex (std::size_t iDummyNodeIndex) |
| void | setGraphLeftTopCoordX (int iLeftTopCoordX, SubGraph &gSubgraph) |
| void | setGraphLeftTopCoordX (int iLeftTopCoordX) |
| void | setGraphLeftTopCoordY (int iLeftTopCoordY, SubGraph &gSubgraph) |
| void | setGraphLeftTopCoordY (int iLeftTopCoordY) |
| void | setGraphCenterCoordX (int iCenterCoordX, SubGraph &gSubgraph) |
| void | setGraphCenterCoordX (int iCenterCoordX) |
| void | setGraphCenterCoordY (int iCenterCoordY, SubGraph &gSubgraph) |
| void | setGraphCenterCoordY (int iCenterCoordY) |
| void | setGraphRadius (double dRadius, SubGraph &gSubgraph) |
| void | setGraphRadius (double dRadius) |
| void | setGraphHeight (int iHeight, SubGraph &gSubgraph) |
| void | setGraphHeight (int iHeight) |
| void | setGraphWidth (int iWidth, SubGraph &gSubgraph) |
| void | setGraphWidth (int iWidth) |
| void | setGraphCoordX (int iCoordX, SubGraph &gSubgraph) |
| void | setGraphCoordX (int iCoordX) |
| void | setGraphCoordY (int iCoordY, SubGraph &gSubgraph) |
| void | setGraphCoordY (int iCoordY) |
| void | setGraphDistanceBetweenCentoidAndCenterCoordX (int iDistanceCoordX, SubGraph &gSubgraph) |
| void | setGraphDistanceBetweenCentoidAndCenterCoordX (int iDistanceCoordX) |
| void | setGraphDistanceBetweenCentoidAndCenterCoordY (int iDistanceCoordY, SubGraph &gSubgraph) |
| void | setGraphDistanceBetweenCentoidAndCenterCoordY (int iDistanceCoordY) |
| void | setAsOwnVertex (VertexDescriptor vVertex, SubGraph &gGraph) |
| void | setGraphUpperBorderVertex (std::size_t vUpperBorderVertex, SubGraph &gGraph) |
| void | setGraphUpperBorderVertex (std::size_t vUpperBorderVertex) |
| void | setGraphLowerBorderVertex (std::size_t vLowerBorderVertex, SubGraph &gGraph) |
| void | setGraphLowerBorderVertex (std::size_t vLowerBorderVertex) |
| template<typename MapVertexOrder > | |
| void | swapVertexOrderByOrder (std::size_t order1, std::size_t order2, MapOrderVertex &mapOrderVertex, MapVertexOrder &mapVertexOrder) |
| template<typename MapVertexOrder > | |
| void | swapVertexOrderByVertex (VertexDescriptor &v1, VertexDescriptor &v2, MapOrderVertex &mapOrderVertex, MapVertexOrder &mapVertexOrder) |
| template<typename MapVertexOrder > | |
| void | leftShiftVertexByOrder (std::size_t iOrderSource, MapOrderVertex &mapOrderVertex, MapVertexOrder &mapVertexOrder) |
| template<typename MapVertexOrder > | |
| void | leftShiftVertexByVertex (VertexDescriptor &vSource, MapOrderVertex &mapOrderVertex, MapVertexOrder &mapVertexOrder) |
| template<typename MapVertexOrder > | |
| void | leftShiftVertexByOrder (std::size_t iOrderSource, MapOrderVertex &mapOrderVertex, MapVertexOrder &mapVertexOrder, int iShiftBy) |
| template<typename MapVertexOrder > | |
| void | leftShiftVertexByVertex (VertexDescriptor &vSource, MapOrderVertex &mapOrderVertex, MapVertexOrder &mapVertexOrder, int iShiftBy) |
| template<typename MapVertexOrder > | |
| void | rightShiftVertexByOrder (std::size_t iOrderSource, MapOrderVertex &mapOrderVertex, MapVertexOrder &mapVertexOrder) |
| template<typename MapVertexOrder > | |
| void | rightShiftVertexByVertex (VertexDescriptor &vSource, MapOrderVertex &mapOrderVertex, MapVertexOrder &mapVertexOrder) |
| template<typename MapVertexOrder > | |
| void | rightShiftVertexByOrder (std::size_t iOrderSource, MapOrderVertex &mapOrderVertex, MapVertexOrder &mapVertexOrder, int iShiftBy) |
| template<typename MapVertexOrder > | |
| void | rightShiftVertexByVertex (VertexDescriptor &vSource, MapOrderVertex &mapOrderVertex, MapVertexOrder &mapVertexOrder, int iShiftBy) |
| void | applyConnectedComponent (SubGraph &gGraph, MapOrderVertex &mapOrderVertex) |
| void | applyTopologicalVertexOrdering (SubGraph &gGraph, MapOrderVertex &mapOrderVertex) |
| void | sortVerticesByOrderList (VectorVertexOrder vecVertexOrder, SubGraph &gGraph) |
| void | initGraphVertexOrderValues (SubGraph &subgraph) |
| VertexDescriptor | addDummyVertexForChildGraph (SubGraph &gParentGraph, SubGraph &gChildGraph) |
| void | setVertXDisp (double iDispX, VertexDescriptor verDis, SubGraph &l_graph) |
| void | setVertYDisp (double iDispY, VertexDescriptor verDis, SubGraph &l_graph) |
| void | setVertexLock (VertexDescriptor verDis, SubGraph &l_graph) |
| void | setGraphClusterID (int iClusterID, SubGraph &gSubgraph) |
| void | setVertexClusterID (int iClusterID, VertexDescriptor vDisc, SubGraph &gSubgraph) |
| bool | setIsVirtualNode (VertexDescriptor vertex, SubGraph &subgraph) |
| void | setClusterXDisplacement (SubGraph &gSubgraph, int iDisp) |
| void | setClusterYDisplacement (SubGraph &gSubgraph, int iDisp) |
Queries | |
The methods under this section are responsible for accessing an instance of type BoostGraphWrapper. | |
| void | printGraph () |
| void | printGraph (SubGraph &subgraph) |
| int | numVertices () |
| int | numVertices (SubGraph &gSubgraph) |
| int | getVertexIndex (VertexDescriptor &vertex) |
| SubGraph & | getGraph () |
| QString | getVertexId (VertexDescriptor &vertex, SubGraph &subgraph) |
| QString | getVertexId (VertexDescriptor &vertex) |
| int | getVertexHeight (VertexDescriptor &vertex, SubGraph &subgraph) |
| int | getVertexHeight (VertexDescriptor &vertex) |
| int | getVertexWidth (VertexDescriptor &vertex, SubGraph &subgraph) |
| int | getVertexWidth (VertexDescriptor &vertex) |
| int | getVertexLeftCoordX (VertexDescriptor &vertex, SubGraph &subgraph) |
| int | getVertexLeftCoordX (VertexDescriptor &vertex) |
| int | getVertexLeftCoordY (VertexDescriptor &vertex, SubGraph &subgraph) |
| int | getVertexLeftCoordY (VertexDescriptor &vertex) |
| int | getVertexCenterCoordX (VertexDescriptor &vertex, SubGraph &subgraph) |
| int | getVertexCenterCoordX (VertexDescriptor &vertex) |
| int | getVertexCenterCoordY (VertexDescriptor &vertex, SubGraph &subgraph) |
| int | getVertexCenterCoordY (VertexDescriptor &vertex) |
| bool | getVertexIsInvisible (VertexDescriptor &vertex, SubGraph &subgraph) |
| bool | getVertexIsInvisible (VertexDescriptor &vertex) |
| bool | getVertexExpandable (VertexDescriptor &vertex, SubGraph &subgraph) |
| bool | getVertexExpandable (VertexDescriptor &vertex) |
| int | getVertexTreeWidth (VertexDescriptor &vertex, SubGraph &subgraph) |
| int | getVertexTreeWidth (VertexDescriptor &vertex) |
| int | getVertexDistanceFromRoot (VertexDescriptor &vertex, SubGraph &subgraph) |
| int | getVertexDistanceFromRoot (VertexDescriptor &vertex) |
| int | getVertexRank (VertexDescriptor &vertex, SubGraph &subgraph) |
| int | getVertexRank (VertexDescriptor &vertex) |
| int | getVertexHorizontalPosition (VertexDescriptor &vertex, SubGraph &subgraph) |
| int | getVertexHorizontalPosition (VertexDescriptor &vertex) |
| double | getVertexBarryCenter (VertexDescriptor &vertex, SubGraph &subgraph) |
| double | getVertexBarryCenter (VertexDescriptor &vertex) |
| int | getVertexTreeLeftX (VertexDescriptor &vertex, SubGraph &subgraph) |
| int | getVertexTreeLeftX (VertexDescriptor &vertex) |
| LayoutEnum::NodeType | getVertexType (VertexDescriptor &vertex, SubGraph &subgraph) |
| LayoutEnum::NodeType | getVertexType (VertexDescriptor &vertex) |
| bool | getVertexVisited (VertexDescriptor &vertex, SubGraph &subgraph) |
| bool | getVertexVisited (VertexDescriptor &vertex) |
| int | getVertexTopologicalOrder (VertexDescriptor &vertex, SubGraph &subgraph) |
| int | getVertexTopologicalOrder (VertexDescriptor &vertex) |
| QString | getEdgeId (EdgeDescriptor &edge, SubGraph &subgraph) |
| QString | getEdgeId (EdgeDescriptor &edge) |
| std::size_t | getEdgeIndex (EdgeDescriptor &edge, SubGraph &subgraph) |
| std::size_t | getEdgeIndex (EdgeDescriptor &edge) |
| bool | getEdgeBidirectional (EdgeDescriptor &edge, SubGraph &subgraph) |
| bool | getEdgeBidirectional (EdgeDescriptor &edge) |
| bool | getEdgeIsInvisible (EdgeDescriptor &edge, SubGraph &subgraph) |
| bool | getEdgeIsInvisible (EdgeDescriptor &edge) |
| bool | getEdgeVisited (EdgeDescriptor &edge, SubGraph &subgraph) |
| bool | getEdgeVisited (EdgeDescriptor &edge) |
| bool | getEdgeReversed (EdgeDescriptor &edge, SubGraph &subgraph) |
| bool | getEdgeReversed (EdgeDescriptor &edge) |
| bool | getEdgeIsConflicted (EdgeDescriptor &edge, SubGraph &subgraph) |
| bool | getEdgeIsConflicted (EdgeDescriptor &edge) |
| LayoutEnum::EdgeType | getEdgeType (EdgeDescriptor eEdge, SubGraph &gGraph) |
| LayoutEnum::EdgeType | getEdgeType (EdgeDescriptor eEdge) |
| std::pair< IteratorQVectorBendPoints, IteratorQVectorBendPoints > | edgeBendPointsIter (EdgeDescriptor &eEdge, SubGraph &gSubgraph) |
| edgeBendPointsIter More... | |
| QString | getGraphId (SubGraph &gSubgraph) |
| QString | getGraphId () |
| std::size_t | getGraphDummyNodeIndex (SubGraph &gSubgraph) |
| std::size_t | getGraphDummyNodeIndex () |
| int | getGraphLeftTopCoordX (SubGraph &gSubgraph) |
| int | getGraphLeftTopCoordX () |
| int | getGraphLeftTopCoordY (SubGraph &gSubgraph) |
| int | getGraphLeftTopCoordY () |
| int | getGraphCenterCoordX (SubGraph &gSubgraph) |
| int | getGraphCenterCoordX () |
| int | getGraphCenterCoordY (SubGraph &gSubgraph) |
| int | getGraphCenterCoordY () |
| double | getGraphRadius (SubGraph &gSubgraph) |
| double | getGraphRadius () |
| int | getGraphHeight (SubGraph &gSubgraph) |
| int | getGraphHeight () |
| int | getGraphWidth (SubGraph &gSubgraph) |
| int | getGraphWidth () |
| int | getGraphCoordX (SubGraph &gSubgraph) |
| int | getGraphCoordX () |
| int | getGraphCoordY (SubGraph &gSubgraph) |
| int | getGraphCoordY () |
| int | getGraphDistanceBetweenCentoidAndCenterCoordX (SubGraph &gSubgraph) |
| int | getGraphDistanceBetweenCentoidAndCenterCoordX () |
| int | getGraphDistanceBetweenCentoidAndCenterCoordY (SubGraph &gSubgraph) |
| int | getGraphDistanceBetweenCentoidAndCenterCoordY () |
| bool | isOwnVertex (VertexDescriptor vVertex, SubGraph &gGraph) |
| std::pair< IteratorQVectorUInt, IteratorQVectorUInt > | ownVerticesIter (SubGraph &gGraph) |
| int | getCountOfOwnVertices (SubGraph &gGraph) |
| std::size_t | getGraphUpperBorderVertex (SubGraph &gGraph) |
| std::size_t | getGraphUpperBorderVertex () |
| std::size_t | getGraphLowerBorderVertex (SubGraph &gGraph) |
| std::size_t | getGraphLowerBorderVertex () |
| VertexDescriptor | getEdgeTarget (EdgeDescriptor edge, SubGraph &subgraph) |
| VertexDescriptor | getEdgeTarget (EdgeDescriptor edge) |
| VertexDescriptor | getEdgeSource (EdgeDescriptor edge, SubGraph &subgraph) |
| VertexDescriptor | getEdgeSource (EdgeDescriptor edge) |
| VertexIterPair | getVertices () |
| VertexIterPair | getVertices (SubGraph &subgraph) |
| ChildrenIterPair | getChildren () |
| ChildrenIterPair | getChildren (SubGraph &subgraph) |
| InEdgeIterPair | getInEdges (VertexDescriptor &vertex) |
| InEdgeIterPair | getInEdges (VertexDescriptor &vertex, SubGraph &subgraph) |
| OutEdgeIterPair | getOutEdges (VertexDescriptor &vertex) |
| OutEdgeIterPair | getOutEdges (VertexDescriptor &vertex, SubGraph &subgraph) |
| void | getChildrenVector (SubGraph &gSubgraph, VectorSubgraphRefs &vecChildSubgraphs) |
| template<typename MapVertexOrder > | |
| MapOrderVertex | getMapOrderedVertices (SubGraph &subgraph, MapVertexOrder &mapVertexOrder) |
| bool | isValidOrder (std::size_t order) |
| int | getVertexOrder (VertexDescriptor &vertex, SubGraph &subgraph) |
| bool | isValidShift (std::size_t iOrderSource, MapOrderVertex &mapOrderVertex, int iShiftBy, ShiftDirection enDirection) |
| int | getEdgeSourceX (EdgeDescriptor eEdge, SubGraph &subGraph) |
| int | getEdgeSourceY (EdgeDescriptor eEdge, SubGraph &subGraph) |
| int | getEdgeTargetX (EdgeDescriptor eEdge, SubGraph &subGraph) |
| int | getEdgeTargetY (EdgeDescriptor eEdge, SubGraph &subGraph) |
| int | getEdgeCrossingCount (SubGraph &gGraph) |
| void | getMinMaxVertexOrder (SubGraph &gSubgraph, int &iMinVertexOrder, int &iMaxVertexOrder) |
| void | getMinMaxVertices (SubGraph &gSubgraph, VertexDescriptor &vMinVertex, VertexDescriptor &vMaxVertex) |
| QString | edgeToQString (EdgeDescriptor eEdge, SubGraph gGraph) |
| int | getVertXDisp (VertexDescriptor verDis, SubGraph &l_graph) |
| int | getVertYDisp (VertexDescriptor verDis, SubGraph &l_graph) |
| bool | getIsVertexLocked (VertexDescriptor verDis, SubGraph &l_graph) |
| int | getGraphClusterID (SubGraph &gSubgraph) |
| int | getVertexClusterID (VertexDescriptor vertex, SubGraph &subgraph) |
| bool | getIsVirtualNode (VertexDescriptor vertex, SubGraph &subgraph) |
| int | getClusterXDisplacement (SubGraph &gSubgraph) |
| int | getClusterYDisplacement (SubGraph &gSubgraph) |
The BoostGraphWrapper class.
The wrapper class round Boost graphs. Provides methods to access and manipulte properties of the graph.
| BoostGraphWrapper::BoostGraphWrapper | ( | ) |
Constructs new object of type BoostGraphWrapper
| BoostGraphWrapper::BoostGraphWrapper | ( | SubGraph | graph | ) |
Constructs new object of type BoostGraphWrapper
| graph | Object of boost graph type |
| void BoostGraphWrapper::addBendPoint | ( | BendPoints * | bendPointRef, |
| EdgeDescriptor | eEdge, | ||
| SubGraph & | gGraph | ||
| ) |
This function prepares list of bend points objects into edge properties of provided graph.
| bendPointRef | reference to bendpoints containing x and y coordinate |
| none |
| VertexDescriptor BoostGraphWrapper::addDummyVertexForChildGraph | ( | SubGraph & | gParentGraph, |
| SubGraph & | gChildGraph | ||
| ) |
This function adds dummy nodes coresponding to each subgraph in the graph
| gParentGraph | referecne to parent graph |
| gChildGraph | reference to child graph |
| none |
| EdgeBoolPair BoostGraphWrapper::addEdge | ( | VertexDescriptor & | vertex1, |
| VertexDescriptor & | vertex2 | ||
| ) |
This function adds edge between provided source and target vertices in the wrapper member graph.
| vertex1 | reference of source vertex. |
| vertex2 | reference of target vertex. |
| none |
| EdgeBoolPair BoostGraphWrapper::addEdge | ( | VertexDescriptor & | vertex1, |
| VertexDescriptor & | vertex2, | ||
| SubGraph & | subgraph | ||
| ) |
This function adds edge between provided source and target vertices in the provided graph.
| vertex1 | reference of source vertex. |
| vertex2 | reference of target vertex. |
| subgraph | referecne to graph |
| none |
| EdgeBoolPair BoostGraphWrapper::addEdge | ( | VertexDescriptor & | vertex1, |
| VertexDescriptor & | vertex2, | ||
| SubGraph & | subgraph, | ||
| LayoutEnum::EdgeType | enEdgeType | ||
| ) |
This function adds edge between provided source and target vertices in the wrapper member graph.
| vertex1 | reference of source vertex. |
| vertex2 | reference of target vertex. |
| subgraph | referecne to graph |
| enEdgeType | type of edge from available types |
| none |
| SubGraph & BoostGraphWrapper::addSubgraph | ( | ) |
This function creates empty subgraph under the hierarchy of wrapper member graph.
| none |
| none |
| SubGraph & BoostGraphWrapper::addSubgraph | ( | SubGraph & | subgraph | ) |
This function creates empty subgraph under the hierarchy of provided graph.
| subgraph | reference to subgraph |
| none |
| VertexDescriptor BoostGraphWrapper::addVertex | ( | ) |
This function adds new vertex in the wrapper member graph.
| none |
| none |
| VertexDescriptor BoostGraphWrapper::addVertex | ( | VertexDescriptor & | vertex | ) |
This function adds provided vertex in the wrapper member graph.
| none |
| none |
| VertexDescriptor BoostGraphWrapper::addVertex | ( | SubGraph & | subgraph | ) |
This function adds new vertex in the provided graph.
| subgraph | reference to input graph |
| none |
| VertexDescriptor BoostGraphWrapper::addVertex | ( | VertexDescriptor & | vertex, |
| SubGraph & | subgraph | ||
| ) |
This functions adds provided vertex in the provided graph.
| subgraph | reference to input graph |
| vertex | reference to vertex |
| none |
| VertexDescriptor BoostGraphWrapper::addVertex | ( | SubGraph & | subgraph, |
| LayoutEnum::NodeType | enVertexType | ||
| ) |
This function adds a vertex (node) of specified type
| subgraph | reference to input graph. |
| enVertexType | type of vertex from available types. |
| none |
| void BoostGraphWrapper::applyConnectedComponent | ( | SubGraph & | gGraph, |
| MapOrderVertex & | mapOrderVertex | ||
| ) |
This function orders the vertices of the graph ion the basis of connected components.
| gGraph | reference to input graph. |
| mapOrderVertex | map containing order for vertices. |
| none |
| void BoostGraphWrapper::applyTopologicalVertexOrdering | ( | SubGraph & | gGraph, |
| MapOrderVertex & | mapOrderVertex | ||
| ) |
This function orders the vertices of the graph in topological manner.
| gGraph | reference to input graph. |
| mapOrderVertex | map containing order for vertices. |
| none |
| std::pair< IteratorQVectorBendPoints, IteratorQVectorBendPoints > BoostGraphWrapper::edgeBendPointsIter | ( | EdgeDescriptor & | eEdge, |
| SubGraph & | gSubgraph | ||
| ) |
edgeBendPointsIter
This function iterates the bend points list of the edge.
| eEdge | graph should contain this edge. |
| gSubgraph |
|
| none |
| ChildrenIterPair BoostGraphWrapper::getChildren | ( | ) |
This function returns pair of children iteartors for getting children of wrapper member graph.
| none |
| none |
| ChildrenIterPair BoostGraphWrapper::getChildren | ( | SubGraph & | subgraph | ) |
This function returns pair of children iteartors for getting children of provided graph.
| subgraph | reference to graph |
| none |
| void BoostGraphWrapper::getChildrenVector | ( | SubGraph & | gSubgraph, |
| VectorSubgraphRefs & | vecChildSubgraphs | ||
| ) |
This function returns children subgraphs of provided graph.
| gSubgraph | reference to subgraph |
| none |
| int BoostGraphWrapper::getCountOfOwnVertices | ( | SubGraph & | gGraph | ) |
This function returns the total number of own vertices of the provided graph.
| gGraph | reference to graph |
| none |
| bool BoostGraphWrapper::getEdgeBidirectional | ( | EdgeDescriptor & | edge, |
| SubGraph & | subgraph | ||
| ) |
This function returns type of edge direction saved in the edge property of provided graph.
| edge | reference to edge |
| subgraph | reference to subgraph |
| none |
| bool BoostGraphWrapper::getEdgeBidirectional | ( | EdgeDescriptor & | edge | ) |
This function returns type of edge direction of wrapper member graph.
| edge | reference to edge |
| none |
| int BoostGraphWrapper::getEdgeCrossingCount | ( | SubGraph & | gGraph | ) |
This function returns count of crossings f edges.
| gGraph | reference to input graph. |
| none |
| QString BoostGraphWrapper::getEdgeId | ( | EdgeDescriptor & | edge, |
| SubGraph & | subgraph | ||
| ) |
This function returns id of edge saved in the edge property of provided graph.
| edge | reference to edge |
| subgraph | reference to subgraph |
| none |
| QString BoostGraphWrapper::getEdgeId | ( | EdgeDescriptor & | edge | ) |
This function returns id of edge of wrapper member graph.
| edge | reference to edge |
| none |
| bool BoostGraphWrapper::getEdgeIsConflicted | ( | EdgeDescriptor & | edge, |
| SubGraph & | subgraph | ||
| ) |
This function returns if edge is conflicted/crossing with another edge saved in the edge property of provided graph.
| edge | reference to edge |
| subgraph | reference to subgraph |
| none |
| bool BoostGraphWrapper::getEdgeIsConflicted | ( | EdgeDescriptor & | edge | ) |
This function returns if edge is conflicted/crossing with another edge of wrapper member graph.
| edge | reference to edge |
| none |
| bool BoostGraphWrapper::getEdgeIsInvisible | ( | EdgeDescriptor & | edge, |
| SubGraph & | subgraph | ||
| ) |
This function returns type of edge invisible saved in the edge property of provided graph.
| edge | reference to edge |
| subgraph | reference to subgraph |
| none |
| bool BoostGraphWrapper::getEdgeIsInvisible | ( | EdgeDescriptor & | edge | ) |
This function returns type of edge invisible of wrapper member graph.
| edge | reference to edge |
| none |
| bool BoostGraphWrapper::getEdgeReversed | ( | EdgeDescriptor & | edge, |
| SubGraph & | subgraph | ||
| ) |
This function returns type of edge reversed saved in the edge property of provided graph.
| edge | reference to edge |
| subgraph | reference to subgraph |
| none |
| bool BoostGraphWrapper::getEdgeReversed | ( | EdgeDescriptor & | edge | ) |
This function returns type of edge reversed of wrapper member graph.
| edge | reference to edge |
| none |
| VertexDescriptor BoostGraphWrapper::getEdgeSource | ( | EdgeDescriptor | edge, |
| SubGraph & | subgraph | ||
| ) |
This function returns the target vertex of provided edge
| gGraph | reference to graph |
| edge | edge from the graph |
| none |
| VertexDescriptor BoostGraphWrapper::getEdgeSource | ( | EdgeDescriptor | edge | ) |
This function returns the source vertex of provided egde.
| edge | value of edge from wrapper member graph |
| none |
| int BoostGraphWrapper::getEdgeSourceX | ( | EdgeDescriptor | eEdge, |
| SubGraph & | subGraph | ||
| ) |
This function returns souce vertex x coordinate of provided edge of provided graph.
| eEdge | edge value |
| subGraph | reference to input graph. |
| none |
| int BoostGraphWrapper::getEdgeSourceY | ( | EdgeDescriptor | eEdge, |
| SubGraph & | subGraph | ||
| ) |
This function returns souce vertex y coordinate of provided edge of provided graph.
| eEdge | edge value |
| subGraph | reference to input graph. |
| none |
| VertexDescriptor BoostGraphWrapper::getEdgeTarget | ( | EdgeDescriptor | edge, |
| SubGraph & | subgraph | ||
| ) |
This function returns the source vertex of provided edge
| gGraph | reference to graph |
| edge | edge from the graph |
| none |
| VertexDescriptor BoostGraphWrapper::getEdgeTarget | ( | EdgeDescriptor | edge | ) |
This function returns the target vertex of provided egde from wrapper member graph.
| edge | value of edge from wrapper member graph |
| none |
| int BoostGraphWrapper::getEdgeTargetX | ( | EdgeDescriptor | eEdge, |
| SubGraph & | subGraph | ||
| ) |
This function returns target vertex x coordinate of provided edge of provided graph.
| eEdge | edge value |
| subGraph | reference to input graph. |
| none |
| int BoostGraphWrapper::getEdgeTargetY | ( | EdgeDescriptor | eEdge, |
| SubGraph & | subGraph | ||
| ) |
This function returns target vertex y coordinate of provided edge of provided graph.
| eEdge | edge value |
| subGraph | reference to input graph. |
| none |
| SubGraph & BoostGraphWrapper::getGraph | ( | ) |
This function returns graph from wrapper member graph.
| none |
| none |
| int BoostGraphWrapper::getGraphCenterCoordX | ( | SubGraph & | gSubgraph | ) |
This function returns center coordinate of provided graph
| gSubgraph | reference to subgraph |
| none |
| int BoostGraphWrapper::getGraphCenterCoordX | ( | ) |
This function returns center x coordinate of wrapper member graph
| none |
| none |
| int BoostGraphWrapper::getGraphCenterCoordY | ( | SubGraph & | gSubgraph | ) |
This function returns center coordinate of provided graph
| gSubgraph | reference to subgraph |
| none |
| int BoostGraphWrapper::getGraphCenterCoordY | ( | ) |
This function returns center y coordinate of wrapper member graph
| none |
| none |
| int BoostGraphWrapper::getGraphDistanceBetweenCentoidAndCenterCoordX | ( | SubGraph & | gSubgraph | ) |
This function returns distance between centroid of graph and center x coordinate of provided graph
| gSubgraph | reference to subgraph |
| none |
| int BoostGraphWrapper::getGraphDistanceBetweenCentoidAndCenterCoordX | ( | ) |
This function returns distance between centroid of graph and center x coordinate of wrapper member graph
| none |
| none |
| int BoostGraphWrapper::getGraphDistanceBetweenCentoidAndCenterCoordY | ( | SubGraph & | gSubgraph | ) |
This function returns distance between y coordinate centroid of graph and center y coordinate of provided graph
| gSubgraph | reference to subgraph |
| none |
| int BoostGraphWrapper::getGraphDistanceBetweenCentoidAndCenterCoordY | ( | ) |
This function returns distance between y coordinate centroid of graph and center y coordinate of wrapper member graph
| none |
| none |
| size_t BoostGraphWrapper::getGraphDummyNodeIndex | ( | SubGraph & | gSubgraph | ) |
This function returns index of this provided graph.
| gSubgraph | reference to graph |
| none |
| size_t BoostGraphWrapper::getGraphDummyNodeIndex | ( | ) |
This function returns index of this wrapper member graph.
| none |
| none |
| int BoostGraphWrapper::getGraphHeight | ( | SubGraph & | gSubgraph | ) |
This function returns height of provided graph
| gSubgraph | reference to subgraph |
| none |
| int BoostGraphWrapper::getGraphHeight | ( | ) |
This function returns height from wrapper member graph
| none |
| none |
| QString BoostGraphWrapper::getGraphId | ( | SubGraph & | gSubgraph | ) |
This function returns id of a provided graph
| gSubgraph | reference to graph |
| none |
| QString BoostGraphWrapper::getGraphId | ( | ) |
This function returns id of a wrapper member graph
| none |
| none |
| int BoostGraphWrapper::getGraphLeftTopCoordX | ( | SubGraph & | gSubgraph | ) |
This function returns left x coordinate of provided graph
| gSubgraph | reference to subgraph |
| none |
| int BoostGraphWrapper::getGraphLeftTopCoordX | ( | ) |
This function returns left x coordinate of wrapper member graph
| none |
| none |
| int BoostGraphWrapper::getGraphLeftTopCoordY | ( | SubGraph & | gSubgraph | ) |
This function returns top y coordinate of provided graph
| gSubgraph | reference to subgraph |
| none |
| int BoostGraphWrapper::getGraphLeftTopCoordY | ( | ) |
This function returns top y coordinate of wrapper member graph
| none |
| none |
| std::size_t BoostGraphWrapper::getGraphLowerBorderVertex | ( | SubGraph & | gGraph | ) |
This function returns the value of the lower border vertex with respect to provided graph.
| gGraph | reference to graph |
| none |
| std::size_t BoostGraphWrapper::getGraphLowerBorderVertex | ( | ) |
This function returns the value of the lower border vertex with respect to wrapper member graph.
| gGraph | reference to graph |
| none |
| double BoostGraphWrapper::getGraphRadius | ( | SubGraph & | gSubgraph | ) |
This function returns radius of provided graph
| gSubgraph | reference to subgraph |
| none |
| double BoostGraphWrapper::getGraphRadius | ( | ) |
This function returns radius of wrapper member graph
| none |
| none |
| std::size_t BoostGraphWrapper::getGraphUpperBorderVertex | ( | SubGraph & | gGraph | ) |
This function returns the value of the upper border vertex with respect to provided graph.
| gGraph | reference to graph |
| none |
| std::size_t BoostGraphWrapper::getGraphUpperBorderVertex | ( | ) |
This function returns the value of the upper border vertex with respect to wrapper member graph.
| gGraph | reference to graph |
| none |
| int BoostGraphWrapper::getGraphWidth | ( | SubGraph & | gSubgraph | ) |
This function returns width of provided graph
| gSubgraph | reference to subgraph |
| none |
| int BoostGraphWrapper::getGraphWidth | ( | ) |
This function returns width from wrapper member graph
| none |
| none |
| InEdgeIterPair BoostGraphWrapper::getInEdges | ( | VertexDescriptor & | vertex | ) |
This function returns inedges coming at the vertex provided from wrapper member graph.
| vertex | reference to vertex |
| none |
| InEdgeIterPair BoostGraphWrapper::getInEdges | ( | VertexDescriptor & | vertex, |
| SubGraph & | subgraph | ||
| ) |
This function returns inedges coming at the vertex provided from provided graph.
| vertex | reference to vertex |
| subgraph | reference tosubgraph |
| none |
|
inline |
This function returns map of vertices ordered by their 'order' property value.
| subgraph | reference to subgraph |
| mapVertexOrder | reference to vertex order map. |
| none |
| void BoostGraphWrapper::getMinMaxVertexOrder | ( | SubGraph & | gSubgraph, |
| int & | iMinVertexOrder, | ||
| int & | iMaxVertexOrder | ||
| ) |
This function calculates the minimum and maximun numbered vertices from the graph.
| gSubgraph | reference to graph. |
| iMaxVertex | value for maximum ordered vertex. |
| iMinVertex | value for minimum ordered vertex. |
| none |
| void BoostGraphWrapper::getMinMaxVertices | ( | SubGraph & | gSubgraph, |
| VertexDescriptor & | vMinVertex, | ||
| VertexDescriptor & | vMaxVertex | ||
| ) |
This function provides the lower index vertex and higher index vertex.
| gSubgraph | reference to graph |
| none |
| OutEdgeIterPair BoostGraphWrapper::getOutEdges | ( | VertexDescriptor & | vertex | ) |
This function returns outedges coming at the vertex provided from wrapper member graph.
| vertex | reference to vertex |
| none |
| OutEdgeIterPair BoostGraphWrapper::getOutEdges | ( | VertexDescriptor & | vertex, |
| SubGraph & | subgraph | ||
| ) |
This function returns outedges coming at the vertex provided from provided graph.
| vertex | reference to vertex |
| subgraph | reference tosubgraph |
| none |
| double BoostGraphWrapper::getVertexBarryCenter | ( | VertexDescriptor & | vertex, |
| SubGraph & | subgraph | ||
| ) |
This function returns barry center of vertex saved in the vertexproperty of provided graph.
| vertex | reference to vertex |
| subgraph | reference to subgraph |
| none |
| double BoostGraphWrapper::getVertexBarryCenter | ( | VertexDescriptor & | vertex | ) |
This function returns barry center of vertex of wrapper member graph.
| vertex | reference to vertex |
| none |
| int BoostGraphWrapper::getVertexCenterCoordX | ( | VertexDescriptor & | vertex, |
| SubGraph & | subgraph | ||
| ) |
This function returns center x coordinate for provided vertex from vertex property of provided graph.
| vertex | reference to vertex |
| subgraph | reference to subgraph |
| none |
| int BoostGraphWrapper::getVertexCenterCoordX | ( | VertexDescriptor & | vertex | ) |
This function returns center x coordinate for provided vertex from vertex property of wrapper member graph.
| vertex | reference to vertex |
| none |
| int BoostGraphWrapper::getVertexCenterCoordY | ( | VertexDescriptor & | vertex, |
| SubGraph & | subgraph | ||
| ) |
This function returns center y coordinate for provided vertex from vertex property of provided graph.
| vertex | reference to vertex |
| subgraph | reference to subgraph |
| none |
| int BoostGraphWrapper::getVertexCenterCoordY | ( | VertexDescriptor & | vertex | ) |
This function returns center y coordinate for provided vertex from vertex property of wrapper member graph.
| vertex | reference to vertex |
| none |
| int BoostGraphWrapper::getVertexDistanceFromRoot | ( | VertexDescriptor & | vertex, |
| SubGraph & | subgraph | ||
| ) |
This function returns distance of vertex from root saved in the vertexproperty of provided graph.
| vertex | reference to vertex |
| subgraph | reference to subgraph |
| none |
| int BoostGraphWrapper::getVertexDistanceFromRoot | ( | VertexDescriptor & | vertex | ) |
This function returns distance from root of vertex of wrapper member graph.
| vertex | reference to vertex |
| none |
| bool BoostGraphWrapper::getVertexExpandable | ( | VertexDescriptor & | vertex, |
| SubGraph & | subgraph | ||
| ) |
This function returns whether provided vertex is expandable or not from vertex property of provided graph.
| vertex | reference to vertex |
| subgraph | reference to subgraph |
| none |
| bool BoostGraphWrapper::getVertexExpandable | ( | VertexDescriptor & | vertex | ) |
This function returns whether provided vertex is expandable or not from vertex property of wrapper member graph.
| vertex | reference to vertex |
| none |
| int BoostGraphWrapper::getVertexHeight | ( | VertexDescriptor & | vertex, |
| SubGraph & | subgraph | ||
| ) |
This function returns height for provided vertex from vertex property of provided graph.
| vertex | reference to vertex |
| subgraph | reference to subgraph |
| none |
| int BoostGraphWrapper::getVertexHeight | ( | VertexDescriptor & | vertex | ) |
This function returns height for provided vertex from vertex property of wrapper member graph.
| vertex | reference to vertex |
| none |
| int BoostGraphWrapper::getVertexHorizontalPosition | ( | VertexDescriptor & | vertex, |
| SubGraph & | subgraph | ||
| ) |
This function returns horizontal position of vertex saved in the vertexproperty of provided graph.
| vertex | reference to vertex |
| subgraph | reference to subgraph |
| none |
| int BoostGraphWrapper::getVertexHorizontalPosition | ( | VertexDescriptor & | vertex | ) |
This function returns horizontal position of vertex of wrapper member graph.
| vertex | reference to vertex |
| none |
| QString BoostGraphWrapper::getVertexId | ( | VertexDescriptor & | vertex, |
| SubGraph & | subgraph | ||
| ) |
This function returns vertex id of provided vertex from vertex property of provided graph.
| vertex | reference to vertex |
| subgraph | reference to subgraph |
| none |
| QString BoostGraphWrapper::getVertexId | ( | VertexDescriptor & | vertex | ) |
This function returns vertex id of provided vertex from vertex property of wrapper member graph.
| vertex | reference to vertex |
| none |
| int BoostGraphWrapper::getVertexIndex | ( | VertexDescriptor & | vertex | ) |
This function returns index for provided vertex present in wrapper member graph.
| vertex | reference to vertex |
| none |
| bool BoostGraphWrapper::getVertexIsInvisible | ( | VertexDescriptor & | vertex, |
| SubGraph & | subgraph | ||
| ) |
This function returns whether provided vertex is invisible or not from vertex property of provided graph.
| vertex | reference to vertex |
| subgraph | reference to subgraph |
| none |
| bool BoostGraphWrapper::getVertexIsInvisible | ( | VertexDescriptor & | vertex | ) |
This function returns whether provided vertex is invisible or not from vertex property of wrapper member graph.
| vertex | reference to vertex |
| none |
| int BoostGraphWrapper::getVertexLeftCoordX | ( | VertexDescriptor & | vertex, |
| SubGraph & | subgraph | ||
| ) |
This function returns left x coordinate for provided vertex from vertex property of provided graph.
| vertex | reference to vertex |
| subgraph | reference to subgraph |
| none |
| int BoostGraphWrapper::getVertexLeftCoordX | ( | VertexDescriptor & | vertex | ) |
This function returns left x coordinate for provided vertex from vertex property of wrapper member graph.
| vertex | reference to vertex |
| none |
| int BoostGraphWrapper::getVertexLeftCoordY | ( | VertexDescriptor & | vertex, |
| SubGraph & | subgraph | ||
| ) |
This function returns left y coordinate for provided vertex from vertex property of provided graph.
| vertex | reference to vertex |
| subgraph | reference to subgraph |
| none |
| int BoostGraphWrapper::getVertexLeftCoordY | ( | VertexDescriptor & | vertex | ) |
This function returns left y coordinate for provided vertex from vertex property of wrapper member graph.
| vertex | reference to vertex |
| none |
| int BoostGraphWrapper::getVertexOrder | ( | VertexDescriptor & | vertex, |
| SubGraph & | subgraph | ||
| ) |
This function returns the order of provided vertex.
| vertex | reference to vertex |
| none |
| int BoostGraphWrapper::getVertexRank | ( | VertexDescriptor & | vertex, |
| SubGraph & | subgraph | ||
| ) |
This function returns rank of vertex saved in the vertexproperty of provided graph.
| vertex | reference to vertex |
| subgraph | reference to subgraph |
| none |
| int BoostGraphWrapper::getVertexRank | ( | VertexDescriptor & | vertex | ) |
This function returns rank of vertex of wrapper member graph.
| vertex | reference to vertex |
| none |
| int BoostGraphWrapper::getVertexTopologicalOrder | ( | VertexDescriptor & | vertex, |
| SubGraph & | subgraph | ||
| ) |
This function returns topological order of vertex saved in the vertexproperty of provided graph.
| vertex | reference to vertex |
| subgraph | reference to subgraph |
| none |
| int BoostGraphWrapper::getVertexTopologicalOrder | ( | VertexDescriptor & | vertex | ) |
This function returns topological order of vertex of wrapper member graph.
| vertex | reference to vertex |
| none |
| int BoostGraphWrapper::getVertexTreeWidth | ( | VertexDescriptor & | vertex, |
| SubGraph & | subgraph | ||
| ) |
This function returns treewidth of vertex.
| vertex | reference to vertex |
| subgraph | reference to subgraph |
| none |
| int BoostGraphWrapper::getVertexTreeWidth | ( | VertexDescriptor & | vertex | ) |
This function returns treewidth of vertex of wrapper member graph.
| vertex | reference to vertex |
| none |
| LayoutEnum::NodeType BoostGraphWrapper::getVertexType | ( | VertexDescriptor & | vertex, |
| SubGraph & | subgraph | ||
| ) |
This function returns type of vertex saved in the vertexproperty of provided graph.
| vertex | reference to vertex |
| subgraph | reference to subgraph |
| none |
| LayoutEnum::NodeType BoostGraphWrapper::getVertexType | ( | VertexDescriptor & | vertex | ) |
This function returns type of vertex of wrapper member graph.
| vertex | reference to vertex |
| none |
| int BoostGraphWrapper::getVertexWidth | ( | VertexDescriptor & | vertex, |
| SubGraph & | subgraph | ||
| ) |
This function returns width for provided vertex from vertex property of provided graph.
| vertex | reference to vertex |
| subgraph | reference to subgraph |
| none |
| int BoostGraphWrapper::getVertexWidth | ( | VertexDescriptor & | vertex | ) |
This function returns width for provided vertex from vertex property of wrapper member graph.
| vertex | reference to vertex |
| none |
| VertexIterPair BoostGraphWrapper::getVertices | ( | ) |
This function returns the vertices in the pair of vertex iterators form of wrapper member graph.
| none |
| VertexIterPair BoostGraphWrapper::getVertices | ( | SubGraph & | subgraph | ) |
This function returns the vertices in the pair of vertex iterators form of provided graph.
| subgraph | reference to subgraph |
| none |
| void BoostGraphWrapper::initGraphVertexOrderValues | ( | SubGraph & | subgraph | ) |
This function initializes the all vertex order values to its index from provided graph.
| gSubgraph | reference to graph. |
| none |
| bool BoostGraphWrapper::isOwnVertex | ( | VertexDescriptor | vVertex, |
| SubGraph & | gGraph | ||
| ) |
This function checks whether provided vertex is own vertex of provided graph.
| vVertex | value of the vertex |
| none |
| bool BoostGraphWrapper::isValidOrder | ( | std::size_t | order | ) |
This function checks the provided order is valid or not.
| order | order value |
| none |
| bool BoostGraphWrapper::isValidShift | ( | std::size_t | iOrderSource, |
| MapOrderVertex & | mapOrderVertex, | ||
| int | iShiftBy, | ||
| ShiftDirection | enDirection | ||
| ) |
This function checks whether the shifting of orders of vertices is valid or not.
| iOrderSource | value of order to be shifted |
| iShiftBy | shift by value |
| mapOrderVertex | reference to order vertex map |
| enDirection | direction of shifting |
| none |
|
inline |
This function shifts the order of vertex provided order of vartex.
| iOrderSource | value of order to be shifted |
| mapOrderVertex | reference to order vertex map |
| enDirection | direction of shifting |
| none |
|
inline |
Function to shift vertex order value to left by using order values
| iOrderSource | |
| mapOrderVertex | |
| mapVertexOrder | |
| iShiftBy |
| none |
|
inline |
This function shifts the order of vertex provided vartex.
| vSource | value of vertex |
| mapOrderVertex | reference to order vertex map |
| enDirection | direction of shifting |
| none |
|
inline |
Function to shift vertex order value to left by using vertices
| vSource | |
| mapOrderVertex | |
| mapVertexOrder | |
| iShiftBy |
| none |
| int BoostGraphWrapper::numVertices | ( | ) |
This function returns total number of vertices present in wrapper member graph.
| none |
| none |
| int BoostGraphWrapper::numVertices | ( | SubGraph & | gSubgraph | ) |
This function returns total number of vertices present in provided graph.
| gSubgraph | reference to gSubgraph |
| none |
| std::pair< IteratorQVectorUInt, IteratorQVectorUInt > BoostGraphWrapper::ownVerticesIter | ( | SubGraph & | gGraph | ) |
This function iterates the ownvertex list of a provided graph
| gGraph | reference to graph |
| none |
| void BoostGraphWrapper::printGraph | ( | ) |
This function prints wrapper member graph.
| none |
| none |
| void BoostGraphWrapper::printGraph | ( | SubGraph & | subgraph | ) |
This function prints provided graph.
| subgraph | reference to subgraph |
| none |
| void BoostGraphWrapper::removeEdge | ( | EdgeDescriptor & | eEdge, |
| SubGraph & | gGraph | ||
| ) |
This function deletes provided edge from provided graph.
| eEdge | reference of edge |
| subgraph | referecne to graph |
| none |
| void BoostGraphWrapper::removeEdge | ( | EdgeDescriptor & | eEdge | ) |
This function deletes provided edge from wrapper member graph.
| eEdge | reference to edge |
| none |
| void BoostGraphWrapper::removeEdge | ( | VertexDescriptor & | vSource, |
| VertexDescriptor & | vTarget, | ||
| SubGraph & | gGraph | ||
| ) |
This function deletes edge between provided source and target vertices from provided graph.
| vSource | reference to vSource |
| vTarget | reference to vTarget |
| gGraph | reference to gGraph |
| none |
| void BoostGraphWrapper::removeEdge | ( | VertexDescriptor & | vSource, |
| VertexDescriptor & | vTarget | ||
| ) |
This function deletes edge between provided source and target vertices from wrapeer member graph.
| vSource | reference to vSource |
| vTarget | reference to vTarget |
| none |
|
inline |
Function to shift vertex order value to right by using order
| iOrderSource | |
| mapOrderVertex | |
| mapVertexOrder |
| none |
|
inline |
Function to shift vertex order value to right by using order values
| iOrderSource | |
| mapOrderVertex | |
| mapVertexOrder | |
| iShiftBy |
|
inline |
Function to shift vertex order value to right by using vertex
| vSource | |
| mapOrderVertex | |
| mapVertexOrder |
| none |
|
inline |
Function to shift vertex order value to right by using vertex
| vSource | |
| mapOrderVertex | |
| mapVertexOrder | |
| iShiftBy |
| void BoostGraphWrapper::setAsOwnVertex | ( | VertexDescriptor | vVertex, |
| SubGraph & | gGraph | ||
| ) |
This function sets provided vertex as a own vertex property for the provided graph.
| vVertex | value of the vertex |
| none |
| void BoostGraphWrapper::setEdgeBidirectional | ( | EdgeDescriptor & | edge, |
| SubGraph & | subgraph, | ||
| bool | bBidirectional | ||
| ) |
This function writes type of edge direction in the edge property of provided graph.
| edge | reference to edge |
| subgraph | reference to subgraph |
| bBidirectional | type of edge direction |
| none |
| void BoostGraphWrapper::setEdgeBidirectional | ( | EdgeDescriptor & | edge, |
| bool | bBidirectional | ||
| ) |
This function writes type of edge direction in the edge property of wrapper member graph.
| edge | reference to edge |
| bBidirectional | type of edge direction |
| none |
| void BoostGraphWrapper::setEdgeId | ( | EdgeDescriptor & | edge, |
| SubGraph & | subgraph, | ||
| QString | sId | ||
| ) |
This function writes id of edge in the edge property of provided graph.
| edge | reference to edge |
| subgraph | reference to subgraph |
| sId | id of edge |
| none |
| void BoostGraphWrapper::setEdgeId | ( | EdgeDescriptor & | edge, |
| QString | sId | ||
| ) |
This function writes edge id in the edge property of wrapper member graph.
| edge | reference to edge |
| sId | id of edge |
| none |
| void BoostGraphWrapper::setEdgeIsConflicted | ( | EdgeDescriptor & | edge, |
| SubGraph & | subgraph, | ||
| bool | bIsConflicted | ||
| ) |
This function writes if edge is conflicted/crossing with another edge in the edge property of provided graph.
| edge | reference to edge |
| subgraph | reference to subgraph |
| bIsConflicted | writes if edge is conflicted/crossing with another edge or not |
| none |
| void BoostGraphWrapper::setEdgeIsConflicted | ( | EdgeDescriptor & | edge, |
| bool | bIsConflicted | ||
| ) |
This function writes if edge is conflicted/crossing with another edge in the edge property of wrapper member graph.
| edge | reference to edge |
| bIsConflicted | if edge is conflicted/crossing with another edge or not |
| none |
| void BoostGraphWrapper::setEdgeIsInvisible | ( | EdgeDescriptor & | edge, |
| SubGraph & | subgraph, | ||
| bool | bIsInvisible | ||
| ) |
This function writes type of edge invisible in the edge property of provided graph.
| edge | reference to edge |
| subgraph | reference to subgraph |
| bIsInvisible | type of edge invisible |
| none |
| void BoostGraphWrapper::setEdgeIsInvisible | ( | EdgeDescriptor & | edge, |
| bool | bIsInvisible | ||
| ) |
This function writes type of edge invisible in the edge property of wrapper member graph.
| edge | reference to edge |
| bIsInvisible | type of edge invisible |
| none |
| void BoostGraphWrapper::setEdgeReversed | ( | EdgeDescriptor & | edge, |
| SubGraph & | subgraph, | ||
| bool | bReversed | ||
| ) |
This function writes type of edge reversed in the edge property of provided graph.
| edge | reference to edge |
| subgraph | reference to subgraph |
| bReversed | type of edge reversed |
| none |
| void BoostGraphWrapper::setEdgeReversed | ( | EdgeDescriptor & | edge, |
| bool | bReversed | ||
| ) |
This function writes type of edge reversed in the edge property of wrapper member graph.
| edge | reference to edge |
| bReversed | type of edge reversed |
| none |
| void BoostGraphWrapper::setGraphCenterCoordX | ( | int | iCenterCoordX, |
| SubGraph & | gSubgraph | ||
| ) |
This function sets center x coordinate to provided graph
| gSubgraph | reference to subgraph |
| iCenterCoordX | value of center x coordinate to be set |
| none |
| void BoostGraphWrapper::setGraphCenterCoordX | ( | int | iCenterCoordX | ) |
This function sets center x coordinate to wrapper member graph
| iCenterCoordX | value of center x coordinate to be set |
| none |
| void BoostGraphWrapper::setGraphCenterCoordY | ( | int | iCenterCoordY, |
| SubGraph & | gSubgraph | ||
| ) |
This function sets center y coordinate to provided graph
| gSubgraph | reference to subgraph |
| iCenterCoordY | value of center y coordinate to be set |
| none |
| void BoostGraphWrapper::setGraphCenterCoordY | ( | int | iCenterCoordY | ) |
This function sets center y coordinate to wrapper member graph
| iCenterCoordY | value of center y coordinate to be set |
| none |
| void BoostGraphWrapper::setGraphDistanceBetweenCentoidAndCenterCoordX | ( | int | iDistanceCoordX, |
| SubGraph & | gSubgraph | ||
| ) |
This function sets distance between centroid of graph and center x coordinate of provided graph
| gSubgraph | reference to subgraph |
| iDistanceCoordX | distance between centroid of graph and center x coordinate |
| none |
| void BoostGraphWrapper::setGraphDistanceBetweenCentoidAndCenterCoordX | ( | int | iDistanceCoordX | ) |
This function sets distance between centroid of graph and center x coordinate of wrapper member graph
| iDistanceCoordX | distance between centroid of graph and center x coordinate |
| none |
| void BoostGraphWrapper::setGraphDistanceBetweenCentoidAndCenterCoordY | ( | int | iDistanceCoordY, |
| SubGraph & | gSubgraph | ||
| ) |
This function sets distance between y coordinate centroid of graph and center y coordinate of provided graph
| gSubgraph | reference to subgraph |
| iDistanceCoordY | distance between centroid of graph and center y coordinate |
| none |
| void BoostGraphWrapper::setGraphDistanceBetweenCentoidAndCenterCoordY | ( | int | iDistanceCoordY | ) |
This function sets distance between y coordinate centroid of graph and center y coordinate of wrapper member graph
| iDistanceCoordY | distance between centroid of graph and center y coordinate |
| none |
| void BoostGraphWrapper::setGraphDummyNodeIndex | ( | std::size_t | iDummyNodeIndex, |
| SubGraph & | gSubgraph | ||
| ) |
This function sets index of this provided graph.
| gSubgraph | reference to graph |
| none |
| void BoostGraphWrapper::setGraphDummyNodeIndex | ( | std::size_t | iDummyNodeIndex | ) |
This function sets index of this wrapper member graph.
| iDummyNodeIndex | value of index to be set |
| none |
| void BoostGraphWrapper::setGraphHeight | ( | int | iHeight, |
| SubGraph & | gSubgraph | ||
| ) |
This function sets height to provided graph
| gSubgraph | reference to subgraph |
| iHeight | value of height to be set |
| none |
| void BoostGraphWrapper::setGraphHeight | ( | int | iHeight | ) |
This function sets height to wrapper member graph
| iHeight | value of height to be set |
| none |
| void BoostGraphWrapper::setGraphId | ( | QString | sId, |
| SubGraph & | gSubgraph | ||
| ) |
This function sets id to provided graph
| gSubgraph | reference to graph |
| sId | id of a graph |
| none |
| void BoostGraphWrapper::setGraphId | ( | QString | sId | ) |
This function sets id to wrapper member graph
| sId | id of a graph |
| none |
| void BoostGraphWrapper::setGraphLeftTopCoordX | ( | int | iLeftTopCoordX, |
| SubGraph & | gSubgraph | ||
| ) |
This function sets left x coordinate to provided graph
| gSubgraph | reference to subgraph |
| iLeftCoordX | value of left coordinate to be set |
| none |
| void BoostGraphWrapper::setGraphLeftTopCoordX | ( | int | iLeftTopCoordX | ) |
This function sets left x coordinate to wrapper member graph
| iLeftCoordX | value of left coordinate to be set |
| none |
| void BoostGraphWrapper::setGraphLeftTopCoordY | ( | int | iLeftTopCoordY, |
| SubGraph & | gSubgraph | ||
| ) |
This function sets top y coordinate to provided graph
| gSubgraph | reference to subgraph |
| iLeftCoordX | value of left coordinate to be set |
| none |
| void BoostGraphWrapper::setGraphLeftTopCoordY | ( | int | iLeftTopCoordY | ) |
This function sets top y coordinate to wrapper member graph
| iLeftCoordY | value of left y coordinate to be set |
| none |
| void BoostGraphWrapper::setGraphLowerBorderVertex | ( | std::size_t | vLowerBorderVertex, |
| SubGraph & | gGraph | ||
| ) |
This function sets the lower border value of provided graph property.
| gGraph | reference to graph |
| vLowerBorderVertex | value of lower border vertex |
| none |
| void BoostGraphWrapper::setGraphLowerBorderVertex | ( | std::size_t | vLowerBorderVertex | ) |
This function sets the lower border value of wrapper member graph property.
| vLowerBorderVertex | value of lower border vertex |
| none |
| void BoostGraphWrapper::setGraphRadius | ( | double | dRadius, |
| SubGraph & | gSubgraph | ||
| ) |
This function sets radius to provided graph
| gSubgraph | reference to subgraph |
| dRadius | value of radius to be set |
| none |
| void BoostGraphWrapper::setGraphRadius | ( | double | dRadius | ) |
This function sets radius to wrapper member graph
| dRadius | value of radius to be set |
| none |
| void BoostGraphWrapper::setGraphUpperBorderVertex | ( | std::size_t | vUpperBorderVertex, |
| SubGraph & | gGraph | ||
| ) |
This function sets the upper border value of provided graph property.
| gGraph | reference to graph |
| vUpperBorderVertex | value of upper border vertex |
| none |
| void BoostGraphWrapper::setGraphUpperBorderVertex | ( | std::size_t | vUpperBorderVertex | ) |
This function sets the upper border value of wrapper member graph property.
| vUpperBorderVertex | value of upper border vertex |
| none |
| void BoostGraphWrapper::setGraphWidth | ( | int | iWidth, |
| SubGraph & | gSubgraph | ||
| ) |
This function sets width to provided graph
| gSubgraph | reference to subgraph |
| iWidth | value of width to be set |
| none |
| void BoostGraphWrapper::setGraphWidth | ( | int | iWidth | ) |
This function sets width to wrapper member graph
| iWidth | value of width to be set |
| none |
| void BoostGraphWrapper::setVertexBarryCenter | ( | VertexDescriptor & | vertex, |
| SubGraph & | subgraph, | ||
| double | dBarryCenter | ||
| ) |
This function writes barry center of vertex in the vertex property of provided graph.
| vertex | reference to vertex |
| subgraph | reference to subgraph |
| dBarryCenter | barry center of vertex in integer |
| none |
| void BoostGraphWrapper::setVertexBarryCenter | ( | VertexDescriptor & | vertex, |
| double | dBarryCenter | ||
| ) |
This function writes vertex barry center value in the vertex property of wrapper member graph.
| vertex | reference to vertex |
| dBarryCenter | value of the barry center. |
| none |
| void BoostGraphWrapper::setVertexCenterCoordY | ( | VertexDescriptor & | vertex, |
| SubGraph & | subgraph, | ||
| int | iCoordY | ||
| ) |
This function writes center y coordinate for provided vertex to vertex property of provided graph.
| vertex | reference to vertex |
| subgraph | reference to subgraph |
| iCoordY | value of center coordinate Y |
| none |
| void BoostGraphWrapper::setVertexCenterCoordY | ( | VertexDescriptor & | vertex, |
| int | iCoordY | ||
| ) |
This function writes center y coordinate for provided vertex to vertex property of wrapper member graph.
| vertex | reference to vertex |
| iCoordY | value of center coordinate y |
| none |
| void BoostGraphWrapper::setVertexDistanceFromRoot | ( | VertexDescriptor & | vertex, |
| SubGraph & | subgraph, | ||
| int | iDistanceFromRoot | ||
| ) |
This function writes distance from root in the vertex property of provided graph.
| vertex | reference to vertex |
| subgraph | reference to subgraph |
| iDistanceFromRoot | distance from root in integer |
| none |
| void BoostGraphWrapper::setVertexDistanceFromRoot | ( | VertexDescriptor & | vertex, |
| int | iDistanceFromRoot | ||
| ) |
This function writes distance from root in the vertex property of wrapper member graph.
| vertex | reference to vertex |
| iDistanceFromRoot | value of the distance from root. |
| none |
| void BoostGraphWrapper::setVertexExpandable | ( | VertexDescriptor & | vertex, |
| SubGraph & | subgraph, | ||
| bool | bIsExpandable | ||
| ) |
This function writes whether provided vertex is invisible or not to vertex property of provided graph.
| vertex | reference to vertex |
| subgraph | reference to subgraph |
| bIsExpandable | boolean whether the vertex is expandable type or not |
| none |
| void BoostGraphWrapper::setVertexExpandable | ( | VertexDescriptor & | vertex, |
| bool | bIsExpandable | ||
| ) |
This function writes whether provided vertex is expandable or not to vertex property of wrapper member graph.
| vertex | reference to vertex |
| bIsExpandable | boolean whether the vertex is epandable type or not |
| none |
| void BoostGraphWrapper::setVertexHeight | ( | VertexDescriptor & | vertex, |
| SubGraph & | subgraph, | ||
| int | iHeight | ||
| ) |
This function sets height for provided vertex to vertex property of provided graph.
| vertex | reference to vertex |
| subgraph | reference to subgraph |
| iHeight | height of vertex |
| none |
| void BoostGraphWrapper::setVertexHeight | ( | VertexDescriptor & | vertex, |
| int | iHeight | ||
| ) |
This function sets height for provided vertex to vertex property of wrapper member graph.
| vertex | reference to vertex |
| iHeight | height of vertex |
| none |
| void BoostGraphWrapper::setVertexHorizontalPosition | ( | VertexDescriptor & | vertex, |
| SubGraph & | subgraph, | ||
| int | iHorizontalPosition | ||
| ) |
This function writes horizontal position of vertex in the vertex property of provided graph.
| vertex | reference to vertex |
| subgraph | reference to subgraph |
| iHorizontalPosition | horizontal position of vertex in integer |
| none |
| void BoostGraphWrapper::setVertexHorizontalPosition | ( | VertexDescriptor & | vertex, |
| int | iHorizontalPosition | ||
| ) |
This function writes vertex horizontal position in the vertex property of wrapper member graph.
| vertex | reference to vertex |
| iHorizontalPosition | value of the horizontal position. |
| none |
| void BoostGraphWrapper::setVertexId | ( | VertexDescriptor & | vertex, |
| SubGraph & | subgraph, | ||
| QString | sId | ||
| ) |
This function sets vertex id for provided vertex to vertex property of provided graph.
| vertex | reference to subgraph |
| vertex | reference to vertex |
| sId | id for the vertex |
| none |
| void BoostGraphWrapper::setVertexId | ( | VertexDescriptor & | vertex, |
| QString | sId | ||
| ) |
This function sets vertex id for provided vertex to vertex property of wrapper member graph.
| vertex | reference to vertex |
| sId | id for the vertex |
| none |
| void BoostGraphWrapper::setVertexIsInvisible | ( | VertexDescriptor & | vertex, |
| SubGraph & | subgraph, | ||
| bool | bIsInvisible | ||
| ) |
This function writes whether provided vertex is invisible or not to vertex property of provided graph.
| vertex | reference to vertex |
| subgraph | reference to subgraph |
| bIsInvisible | boolean whether the vertex is visible type or not |
| none |
| void BoostGraphWrapper::setVertexIsInvisible | ( | VertexDescriptor & | vertex, |
| bool | bIsInvisible | ||
| ) |
This function writes whether provided vertex is invisible or not to vertex property of wrapper member graph.
| vertex | reference to vertex |
| bIsInvisible | boolean whether the vertex is visible type or not |
| none |
| void BoostGraphWrapper::setVertexLeftCoordX | ( | VertexDescriptor & | vertex, |
| int | iLeftCoordX | ||
| ) |
This function writes left x coordinate for provided vertex to vertex property of wrapper member graph.
| vertex | reference to vertex |
| iLeftCoordX | value of left coordinate X |
| none |
| void BoostGraphWrapper::setVertexLeftCoordX | ( | VertexDescriptor & | vertex, |
| SubGraph & | subgraph, | ||
| int | iLeftCoordX | ||
| ) |
This function writes left x coordinate for provided vertex to vertex property of provided graph.
| vertex | reference to vertex |
| subgraph | reference to subgraph |
| iLeftCoordX | value of left coordinate X |
| none |
| void BoostGraphWrapper::setVertexLeftCoordY | ( | VertexDescriptor & | vertex, |
| SubGraph & | subgraph, | ||
| int | iLeftCoordY | ||
| ) |
This function writes left y coordinate for provided vertex to vertex property of wrapper member graph.
| vertex | reference to vertex |
| subgraph | reference to subgraph |
| iLeftCoordY | value of left coordinate Y |
| none |
| void BoostGraphWrapper::setVertexLeftCoordY | ( | VertexDescriptor & | vertex, |
| int | iLeftCoordY | ||
| ) |
This function writes left y coordinate for provided vertex to vertex property of wrapper member graph.
| vertex | reference to vertex |
| iLeftCoordY | value of left coordinate Y |
| none |
| void BoostGraphWrapper::setVertexRank | ( | VertexDescriptor & | vertex, |
| SubGraph & | subgraph, | ||
| int | iRank | ||
| ) |
This function writes rank of vertex in the vertex property of provided graph.
| vertex | reference to vertex |
| subgraph | reference to subgraph |
| iRank | rank of vertex in integer |
| none |
| void BoostGraphWrapper::setVertexRank | ( | VertexDescriptor & | vertex, |
| int | iRank | ||
| ) |
This function writes vertex rank in the vertex property of wrapper member graph.
| vertex | reference to vertex |
| iRank | value of the vertex rank. |
| none |
| void BoostGraphWrapper::setVertexTopologicalOrder | ( | int | iTopologicalOrder, |
| VertexDescriptor & | vertex, | ||
| SubGraph & | subgraph | ||
| ) |
This function writes topological order of vertex in the vertex property of provided graph.
| vertex | reference to vertex |
| subgraph | reference to subgraph |
| iTopologicalOrder | topological order of vertex in integer |
| none |
| void BoostGraphWrapper::setVertexTopologicalOrder | ( | int | iTopologicalOrder, |
| VertexDescriptor & | vertex | ||
| ) |
This function writes vertex topological order in the vertex property of wrapper member graph.
| vertex | reference to vertex |
| iTopologicalOrder | topological order of vertex in integer |
| none |
| void BoostGraphWrapper::setVertexTreeWidth | ( | VertexDescriptor & | vertex, |
| SubGraph & | subgraph, | ||
| int | iTreeWidth | ||
| ) |
This function writes treewidth in the vertex property of provided graph.
| vertex | reference to vertex |
| subgraph | reference to subgraph |
| iTreeWidth | tree width in integer |
| none |
| void BoostGraphWrapper::setVertexTreeWidth | ( | VertexDescriptor & | vertex, |
| int | iTreeWidth | ||
| ) |
This function writes treewidth in the vertex property of wrapper member graph.
| vertex | reference to vertex |
| iTreeWidth | value of the treewidth |
| none |
| void BoostGraphWrapper::setVertexType | ( | VertexDescriptor & | vertex, |
| SubGraph & | subgraph, | ||
| LayoutEnum::NodeType | enVertexType | ||
| ) |
This function writes type of vertex in the vertex property of provided graph.
| vertex | reference to vertex |
| subgraph | reference to subgraph |
| enVertexType | type of vertex |
| none |
| void BoostGraphWrapper::setVertexType | ( | VertexDescriptor & | vertex, |
| LayoutEnum::NodeType | enVertexType | ||
| ) |
This function writes vertex type in the vertex property of wrapper member graph.
| vertex | reference to vertex |
| enVertexType | type of vertex from available types |
| none |
| void BoostGraphWrapper::setVertexWidth | ( | VertexDescriptor & | vertex, |
| SubGraph & | subgraph, | ||
| int | iWidth | ||
| ) |
This function sets width for provided vertex to vertex property of provided graph.
| vertex | reference to vertex |
| subgraph | reference to subgraph |
| iWidth | width of vertex |
| none |
| void BoostGraphWrapper::setVertexWidth | ( | VertexDescriptor & | vertex, |
| int | iWidth | ||
| ) |
This function sets width for provided vertex to vertex property of wrapper member graph.
| vertex | reference to vertex |
| iWidth | width of vertex |
| none |
| void BoostGraphWrapper::sortVerticesByOrderList | ( | VectorVertexOrder | vecVertexOrder, |
| SubGraph & | gGraph | ||
| ) |
This function sorts the vertices of the graph in orderly manner.
| gGraph | reference to input graph. |
| vecVertexOrder | map containing vertices for order. |
| none |
|
inline |
This function swaps vertex's provided orders in 'graph' as well as 'mapOrderVertex'
| order1 | value of first order |
| order2 | value of second order |
| mapOrderVertex | reference to order vertex map |
| mapVertexOrder | reference to vertex order map |
| none |
|
inline |
This function swaps vertex's orders provided vertices in 'graph' as well as 'mapOrderVertex'
| v1 | reference to first vertex |
| v2 | reference to second vertex |
| mapOrderVertex | reference to order vertex map |
| mapVertexOrder | reference to vertex order map |
| none |


Dr. Tailor
Menu
How We work
Services
User Guide
Login/Sign up
Contact
Dashboard
Lorem ipsum dolor sit amet consectetur.
My Account
My Orders
My Coupons
My Carts
My Wishlist
User Details
Our representative will visit you as per the scheduled appointment.
Share Reference Design If Any
Submit


Weather
Current temperature:
20
London
New York
Paris
Tokyo
Current temperature:
Energy usage:
-
+
reset
PSM on


Ethan College Honk Gong
Here's to the ones that we got
Cheers to the wish you were here, but you're not
'Cause the drinks bring back all the memories
Of everything we've been through
Toast to the ones here today
Toast to the ones that we lost on the way
'Cause the drinks bring back all the memories
And the memories bring back,
memories bring back you
There's a time that I remember,
when I did not know no pain
When I believed in forever,
and everything would stay the same
Now my heart feel like December when somebody say your name
'Cause I can't reach out to call you,
but I know I will one day, yeah
Everybody hurts sometimes
Everybody hurts someday, aye aye
But everything gon' be alright
Go and raise a glass and say, aye
Here's to the ones that we got
Cheers to the wish you were here, but you're not
'Cause the drinks bring back all the memories
Of everything we've been through
Toast to the ones here today
Toast to the ones that we lost on the way
'Cause the drinks bring back all the memories
And the memories bring back, memories bring back you
Is this the real life? Is this just fantasy? Caught in a landslide, No escape from reality. Open your eyes, Look up to the skies and see, I'm just a poor boy, I need no sympathy, Because I'm easy come, easy go, Little high, little low, Any way the wind blows doesn't really matter to me, to me.
Aaow!
I see a little silhouetto of a man, Scaramouche, Scaramouche, will you do the Fandango? Thunderbolt and lightning, Very, very frightening me. (Galileo) Galileo. (Galileo) Galileo, Galileo Figaro Magnifico-o-o-o-o. I'm just a poor boy, nobody loves me. He's just a poor boy from a poor family, Spare him his life from this monstrosity. Easy come, easy go, will you let me go? Bismillah! No, we will not let you go. (Let him go!) Bismillah! We will not let you go. (Let him go!) Bismillah! We will not let you go. (Let me go!) Will not let you go. (Let me go!)  Beelzebub has a devil put aside for me, for me, for me.
Never Gonna Give You Up Never Gonna Let You Down
It's a little bit funny this feeling inside I'm not one of those who can easily hide, I Don't have much money but boy if I did I'd buy a big house where we both could live If I was a sculptor, but then again no Or a man who makes potions in a traveling show Oh I know it's not much but it's the best I can do My gift is my song And this one's for you
It might seem crazy what I'm 'bout to say Sunshine she's here, you can take a break I'm a hot air balloon that could go to space With the air, like I don't care baby by the way Huh, because I'm happy Clap along if you feel like a room without a roof Because I'm happy Clap along if you feel like happiness is the truth Because I'm happy Clap along if you know what happiness is to you Because I'm happy Clap along if you feel like that's what you wanna do C'mon!
Billie Jean is not my lover She's just a girl who claims that I am the one (Oh, baby) But the kid is not my son, hoo! She says I am the one (Oh, baby) But the kid is not my son (Hee-hee-hee, no-no-no, hee-hee-hee) Hoo! She was more like a beauty queen from a movie scene I said, "Don't mind, but what do you mean, I am the one Who will dance on the floor in the round?" She said I am the one Who will dance on the floor, in the round She told me her name was Billie Jean As she caused a scene Then every head turned with eyes that dreamed of being the one Who will dance on the floor in the round People always told me, "Be careful of what you do Don't go around breaking young girls' hearts" (Hee-eeh) And mother always told me, "Be careful of who you love And be careful of what you do (Oh-oh) 'Cause the lie becomes the truth" (Oh-oh) Billie Jean is not my lover She's just a girl who claims that I am the one (Oh, baby) But the kid is not my son, hoo! She says I am the one (Oh, baby) But the kid is not my son (Hee-hee-hee, no-no-no, hee-hee-hee) Hoo!
The club isn't the best place to find a lover So the bar is where I go Me and my friends at the table doing shots Drinking fast and then we talk slow Come over and start up a conversation with just me And trust me I'll give it a chance now Take my hand, stop, put Van the Man on the jukebox And then we start to dance, and now I'm singing like Girl, you know I want your love Your love was handmade for somebody like me Come on now, follow my lead I may be crazy, don't mind me Say, boy, let's not talk too much Grab on my waist and put that body on me Come on now, follow my lead Come, come on now, follow my lead I'm in love with the shape of you We push and pull like a magnet do Although my heart is falling too I'm in love with your body
Up with it girl Rock with it girl Show dem it girl (Bada bang bang) Bounce with it girl Dance with it girl Get with it girl (Bada bang bang) Come on, come on, turn the radio on It's Friday night and I won't be long Gotta do my hair, I put my make up on It's Friday night and I won't be long Till I hit the dance floor (Bada bang) Hit the dance floor (Bada bang) I got all I need No, I ain't got cash, I ain't got cash But I got you baby (Just you an me) Baby I don't need dollar bills to have fun tonight (I love cheap thrills!) Baby I don't need dollar bills to have fun tonight (I love cheap thrills!)


Superstars Rajinikanth, Kamal Haasan Willing to Join Hands Politically 'if Need Arises'
Speculations arose when the superstar-politician attended an event on Sunday to celebrate Kamal Haasan's 60 years in Indian cinema.
New Delhi: Two of Tamil Nadu’s most popular actors-turned politicians Rajinikanth and Kamal Haasan on Tuesday hinted at a possible tie-up for the betterment of the state ‘if need arises’.
Speaking to reporters at Chennai airport, Makkal Needhi Maian (MNM) Haasan who set the ball rolling first, said, “Our friendship is continuing for the last 44 years. If the need arises, we can come together for the development of Tamil Nadu.”
Within an hour, his long-standing friend Rajinikanth echoed a similar sentiment and said, “If the circumstances demand, I will join hands with Kamal Haasan.”
Speculations arose when the superstar-politician attended an event on Sunday to celebrate Kamal Haasan’s 60 years in Indian cinema. At the event, Rajinikanth had slammed at Tamil Nadu Chief Minister saying, “Miracles and wonders do happen in politics.”
The development also comes in the backdrop of Rajinikanth trying to set himself apart from the BJP, alleging that the party is trying to “saffronise him”.
Notably, while Rajinikanth did not is geared up to set the tone high in the Tamil Nadu Assembly elections scheduled to take place in 2021. While he did not field any candidates in the 2019 Lok Sabha Elections, Haasan’s MNM contested in a total of 40 seats – 39 in Tamil Nadu and one in Puducherry.
For breaking news and live news updates, like us on Facebook or follow us on Twitter and Instagram. Read more on India Latest News on India.com.
Story Timeline
- 19 Nov 2019 Superstars Rajinikanth, Kamal Haasan Willing to Join Hands Politically 'if Need Arises'
- 08 Nov 2019 I Won't Fall Into Their Trap, Says Rajinikanth on Joining BJP
- 27 Oct 2019 TN: Operations Underway to Rescue 2-year-old Boy From 25 Feet Deep Borewell
- 08 Oct 2019 Kamal Haasan Condemns Sedition Case Against 49 Celebrities, Asks Supreme Court To Quash the FIR
Comments - Join the Discussion


| gamma.dispersion {MASS} | R Documentation |
A front end to gamma.shape
for convenience. Finds the
reciprocal of the estimate of the shape parameter only.
gamma.dispersion(object, ...)
object |
Fitted model object giving the gamma fit. |
... |
Additional arguments passed on to |
The MLE of the dispersion parameter of the gamma distribution.
Venables, W. N. and Ripley, B. D. (2002) Modern Applied Statistics with S. Fourth edition. Springer.
gamma.shape.glm
, including the example on its help page.


In the world of graphs, there are numerous graph types. The diagram below describes the important feature of a collection of common graph types. Note that many of these types can be mixed and matched. For example, the property graph model of Blueprints can be seen as a vertex/edge-labeled/attributed, directed, multi-graph.
- half-edge graph: a unary edge graph where an edge connects only one vertex.
- multi-graph: when edges are labeled, the various ways in which vertices are related can be denoted.
- simple graph: the prototypical graph where an edge connects two vertices and no loops are allowed.
- weighted graph: used to represent strength of ties or transition probabilities.
- vertex-labeled graph: most every graph makes use of labeled vertices (e.g. an identifier)
- semantic graph: used to model cognitive structures such as the relationship between concepts and instances of a concept.
- vertex-attributed: used in applications where it is desirable to append non-relational metadata to a vertex.
- edge-labeled graph: provides the ability to denote the way in which two vertices are related (e.g. friendships, kinships, etc.).
- directed graph: orders the vertices connected by an edge to denote directionality.
- hypergraph: generalizes a binary graph to allow an edge to connect to an arbitrary number of vertices.
- undirected graph: the typical graph that is used when the relationship is symmetrical (e.g. friendship).
- resource description framework graph: a graph standard developed by the the World Wide Web consortium that denotes vertices and edges by Uniform Resource Identifiers (see Sail Implementation and Sail Ouplementation).
- edge-attributed graph: used in applications where its desirable to append non-relational metadata to an edge.
- pseudo graph: generally allowed in most disciplines to denote a reflexive relationship.
The property graph model is a convenient graph data model as it is easy to represent other graph types. The following diagram provides the morphisms that go from one graph type to another. Note that a hypergraph can be modeled using a property graph, though its not as straightforward as modeling other graph types.